31 search results - page 1 / 7 » Minimum independent dominating sets of random cubic graphs |
RSA
2002
13 years 5 months ago
2002
COMBINATORICS
2002
13 years 5 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,...
ESA
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
COLOGNETWENTE
2007
13 years 6 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
DAM
1999
13 years 5 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...