Packing vertices and edges in random regular graphs

DOI10.1002/rsa.20165zbMath1130.05051OpenAlexW4246964435MaRDI QIDQ5436974

Mihalis Beis, William Duckworth, Michele Zito

Publication date: 18 January 2008

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

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

zbMATH Keywords

algorithmsrandom graphsmatchingsindependent sets

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

THE DEPRIORITISED APPROACH TO PRIORITISED ALGORITHMS

Cites Work

• Average-case analysis of algorithms for matchings and related problems
• Paths, Trees, and Flowers
• Unnamed Item

This page was built for publication: Packing vertices and edges in random regular graphs