Sciweavers

62 search results - page 10 / 13
» Induced trees in triangle-free graphs
Sort
View
MSN
2007
Springer
14 years 1 months ago
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
Harri Haanpää, André Schumacher, ...
CORR
2007
Springer
122views Education» more  CORR 2007»
13 years 7 months ago
How to Complete a Doubling Metric
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced...
Anupam Gupta, Kunal Talwar
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
13 years 7 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
ICDE
2009
IEEE
126views Database» more  ICDE 2009»
14 years 2 months ago
Querying Communities in Relational Databases
— Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is speciï¬...
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao
ACID
2006
220views Algorithms» more  ACID 2006»
13 years 8 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove