7 search results - page 1 / 2 » The effect of girth on the kernelization complexity of Conne... |
FSTTCS
2010
Springer
14 years 4 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...
GLOBECOM
2006
IEEE
15 years 7 days ago
2006
IEEE
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
JPDC
2007
14 years 6 months ago
2007
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
107
click to vote
IWPEC
2010
Springer
14 years 4 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
MOBIHOC
2008
ACM
15 years 5 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...