On the independent domination number of random regular graphs

Combinatorics Probability and Computing

Volumn 15, Issue 4, 2006, Pages 513-522

  Duckworth, W ^a   Wormald, N C ^b  

^a MACQUARIE UNIVERSITY   (Australia)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; RANDOM PROCESSES; SET THEORY;

CARDINALITY; GREEDY ALGORITHM; VERTEX;

GRAPH THEORY;

EID: 33744948267     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548305007431     Document Type: Article

References (16)

1. Alimonti, P. and Calamoneri, T. (1997) Improved approximations of independent dominating set in bounded degree graphs. In 22nd Internat. Workshop on Graph-Theoretic Concepts in Computer Science, Vol. 1197 of Lecture Notes in Computer Science, Springer, pp. 2-16.
2. Bollobás, B. (1985) Random Graphs, Academic Press.
3. Diestel, R. (2000) Graph Theory, Springer, New York.
4. Duckworth, W. and Wormald, N. C. (2002) Minimum independent dominating sets of random cubic graphs. Random Struct. Alg. 21 147-161.
5. Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability, Freeman, San Francisco, California.
6. Halldórsson, M. M. (1993) Approximating the minimum maximal independence number. Inform. Process. Lett. 46 169-172.
7. Johnson, D. S. (1994) Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9 256-278.
8. Kann, V. (1992) On the approximability of NP-complete optimisation problems. Doctoral thesis, Department of Numerical Analysis, Royal Institute of Technology, Stockholm.
9. Molloy, M. and Reed, B. (1995) The dominating number of a random cubic graph. Random Struct. Alg. 1 209-221.
10. Papadimitriou, C. H. and Yannakakis, M. (1991) Optimization, approximation and complexity classes. J. Comput. Syst. Sci. 43 425-440.
11. Raz, R. and Safra, S. (1997) A sub-constant error-probability low-degree test and a sub-constant error-probability PCP characterization of NP. In Proc. 29th Annual ACM Symposium on the Theory of Computing, pp. 475-484.
12. Wormald, N. C. (1995) Differential equations for random processes and random graphs. Ann. Appl. Probab. 5 1217-1235.
13. Wormald, N. C. (1999) Models of random regular graphs. In Surveys in Combinatorics, 1999: Canterbury, Cambridge University Press, Cambridge, pp. 239-298.
14. Wormald, N. C. (1999) The differential equation method for random graph processes and greedy algorithms. In Lectures on Approximation and Randomized Algorithms (M. Karoński and H. Prömel, eds), PWN, Warsaw, pp. 73-155.
15. Wormald, N. C. (2003) Analysis of greedy algorithms on graphs with bounded degrees. Discrete Math. 273 235-260.
16. Zito, M. (2001) Greedy algorithms for minimisation problems in random regular graphs. In 9th Annual European Symposium, Vol. 2161 of Lecture Notes in Computer Science, Springer, pp. 524-536.