59 search results - page 2 / 12 » Real and integer domination in graphs |
WETICE
2007
IEEE
14 years 1 hour ago
2007
IEEE
Designing a collaborative architecture for real-time applications is an intricate challenge that usually involves dealing with the real-time constraints, resource limitations and ...
IWPEC
2009
Springer
14 years 8 days ago
2009
Springer
![Planar Capacitated Dominating Set Is W[1]-Hard](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Planar Capacitated Dominating Set Is W[1]-Hard")
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...
PODC
2010
ACM
13 years 9 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
ICDCS
2008
IEEE
14 years 5 days ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
RSA
2006
13 years 5 months ago
2006
Let n be a positive integer and > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(, n) to be the graph w...