52 search results - page 1 / 11 » Minimum Connected Dominating Sets of Random Cubic Graphs |
COMBINATORICS
2002
14 years 10 months ago
2002
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
74
Voted
RSA
2002
14 years 9 months ago
2002
100
Voted
GC
2008
Springer
14 years 10 months ago
2008
Springer
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...
98
Voted
JCO
2008
14 years 10 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 ...
141
Voted
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...