406 search results - page 3 / 82 » Dominating Sets in Web Graphs |
111
click to vote
TAMC
2009
Springer
15 years 9 months ago
2009
Springer
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
147
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
148
click to vote
CCCG
2010
15 years 4 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
152
Voted
WDAG
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
110
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...