Randomized greedy algorithms for finding smallk-dominating sets of regular graphs

DOI10.1002/rsa.20082zbMath1079.05088OpenAlexW1968934446MaRDI QIDQ5704842

No author found.

Publication date: 15 November 2005

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20082

zbMATH Keywords

random regular graphdifferential equations method

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Total domination in regular graphs ⋮ Asymptotic bounds on total domination in regular graphs ⋮ Connected domination of regular graphs ⋮ Minimum 2-dominating sets in regular graphs

Cites Work

• Minimum connected dominating sets of random cubic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item