Minimum Independent Dominating Sets of Random Cubic Graphs

Random Structures and Algorithms

Volumn 21, Issue 2, 2002, Pages 147-161

  Duckworth, W ^a,b   Wormald, N C ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036369825     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10047     Document Type: Article

References (13)

1. B. Bollobás, Random graphs, Academic, London, 1985.
2. W. Duckworth, Greedy algorithms and cubic graphs, Ph.D. thesis, Department of Mathematics and Statistics, University of Melbourne, Australia, 2001.
3. W. Duckworth and N. C. Wormald, Linear programming and the worst-case analysis of greedy algorithms on cubic graphs, in preparation.
4. M. R. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, San Francisco, 1979.
5. M. M. Halldórsson, Approximating the minimum maximal independence number, Inf Process Lett 46(4) (1993), 169-172.
6. V. Kann, On the approximability of NP-complete optimisation problems, Ph.D. thesis, Department of Numerical Analysis, Royal Institute of Technology, Stockholm, 1992.
7. P. C. B. Lam, W. C. Shiu, and L. Sun, On the independent domination number of regular graphs, Discrete Math 202 (1999), 135-144.
8. M. Molloy and B. Reed, The dominating number of a random cubic graph, Random Struct Alg 7(3) (1995), 209-221.
9. B. Reed, Paths, stars and the number three, Combinat Probab Comput 5 (1996), 277-295.
10. R. W. Robinson and N. C. Wormald, Almost all cubic graphs are Hamiltonian, Random Struct Alg 3(7) (1992), 117-125.
11. N. C. Wormald, Differential equations for random processes and random graphs, Ann Appl Probab 5 (1995), 1217-1235.
12. N. C. Wormald, Models of random regular graphs, Surveys in combinatorics, 1999 (Canter-bury), Cambridge University Press, Cambridge, 1999, pp. 239-298.
13. N. C. Wormald, "The differential equation method for random graph processes and greedy algorithms," Lectures on approximation and randomized algorithms, M. Karonski and H. J. Prömel (Editors), PWN, Warsaw, 1999, pp. 73-155.