406 search results - page 14 / 82 » Dominating Sets in Web Graphs |
ICALP
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
JCO
2007
13 years 9 months ago
2007
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
JCIT
2008
13 years 9 months ago
2008
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
MOBIHOC
2002
ACM
14 years 8 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...