1536 search results - page 7 / 308 » Approximately Dominating Representatives |
CCCG
2010
13 years 9 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 ...
JCO
2008
13 years 7 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
ICPR
2010
IEEE
13 years 6 months ago
2010
IEEE
In this paper we propose a conductance electrical model to represent weighted undirected graphs that allows us to efficiently compute approximate graph isomorphism in large graph...
PODC
2010
ACM
13 years 11 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...
HICSS
2002
IEEE
14 years 18 days ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...