58 search results - page 11 / 12 » Collective Tree Spanners in Graphs with Bounded Parameters |
SIGECOM
2009
ACM
15 years 6 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
106
click to vote
DMIN
2006
15 years 29 days ago
2006
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
124
click to vote
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
CP
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/o...