331 search results - page 35 / 67 » Approximation Algorithms for Connected Dominating Sets |
101
click to vote
WWW
2010
ACM
15 years 6 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
113
click to vote
HIPC
2000
Springer
15 years 3 months ago
2000
Springer
In this paper, we propose a distributed clustering algorithm for a multi-hop packet radio network. These types of networks, also known as ad hoc networks, are dynamic in nature due...
STOC
2005
ACM
16 years 2 days ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
108
click to vote
ICDCS
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
110
click to vote
WABI
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...