406 search results - page 8 / 82 » Dominating Sets in Web Graphs |
AHSWN
2008
14 years 10 months ago
2008
Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new i...
DM
2006
14 years 10 months ago
2006
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination...
109
click to vote
COCOON
2007
Springer
15 years 4 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
COMBINATORICS
2006
14 years 10 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
ARSCOM
2007
14 years 10 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...