Minimum connected dominating sets of random cubic graphs

Electronic Journal of Combinatorics

Volumn 9, Issue 1 R, 2002, Pages 1-13

  Duckworth, W ^a,b  

^a MACQUARIE UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4043161374     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1624     Document Type: Article

References (14)

1. B. Bollobás. Random Graphs. Academic Press, 1985.
2. R. Diestel. Graph Theory. Springer-Verlag, 1997.
3. W. Duckworth. Greedy Algorithms and Cubic Graphs. Doctoral Thesis, Department of Mathematics and Statistics, The University of Melbourne, 2001.
4. W. Duckworth and N.C. Wormald. Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs. Submitted.
5. G. Galbiati, F. Maffioli, and A. Morzenti. A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem. Information Processing Letters, 52(1):45-49, 1994.
6. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Company, 1979.
7. J.R. Griggs, D.J. Kleitman, and A. Shastri. Spanning Trees with Many Leaves in Cubic Graphs. Journal of Graph Theory, 13(6):669-695, 1989.
8. S. Janson, T. Łuczak and A. Rucinski. Random Graphs. Wiley, 2000.
9. Hsueh-I Lu and R. Ravi. Approximating Maximum Leaf Spanning Trees in Almost Linear Time. Journal of Algorithms, 29(1):132-141, 1998.
10. J.A. Storer. Constructing Full Spanning Trees for Cubic Graphs. Information Processing Letters, 13(1), 8-11, 1981.
11. R. Solis-Oba. 2-Approximation Algorithm for finding a Spanning Tree with Maximum Number of leaves. In Proceedings of the Sixth European Symposium on Algorithms, Venice, 1998. Lecture Notes in Computer Science, 1461:441-452, Springer, 1998.
12. N.C. Wormald, Differential Equations for Random Processes and Random Graphs. Annals of Applied Probability, 5:1217-1235, 1995.
13. N.C. Wormald. Models of Random Regular Graphs. In Surveys in combinatorics, Canterbury, 1999, pages 239-298. Cambridge University Press, 1999.
14. N.C. Wormald. The Differential Equation Method for Random Graph Processes and Greedy Algorithms. In Michał Karoński and Hans-Jürgen Prömel, editors, Lectures on Approximation and Randomized Algorithms, pages 73-155. PWN, Warsaw, 1999.