论文信息 - Large 2-Independent Sets of Regular Graphs

Large 2-Independent Sets of Regular Graphs

Abstract We present a simple, yet efficient, heuristic for finding a large 2-independent set of regular graphs. We analyse the average-case performance of this heuristic, which is a randomised greedy algorithm, by analysing its performance on random regular graphs using differential equations. In this way, we prove lower bounds on the expected size of a largest 2-independent set of random regular graphs. Our results compare favourably with corresponding known upper bounds.

William Duckworth | Michele Zito

[1] William Duckworth. Maximum 2-independent sets of random cubic graphs , 2003, Australas. J Comb..

[2] Marcin Paprzycki,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..

[3] N. Wormald. Differential Equations for Random Processes and Random Graphs , 1995 .

[4] Madhumangal Pal,et al. An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs , 2001, Comput. Optim. Appl..

[5] Reinhard Diestel,et al. Graph Theory , 1997 .

[6] William Duckworth,et al. Packing Edges in Random Regular Graphs , 2002, MFCS.

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] Hagit Attiya,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[9] N. Wormald,et al. Models of the , 2010 .

[10] N. Wormald. The differential equation method for random graph processes and greedy algorithms , 1999 .

[11] William Duckworth,et al. Minimum independent dominating sets of random cubic graphs , 2002, Random Struct. Algorithms.