Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time
From MaRDI portal
Publication:3521916
DOI10.1007/978-3-540-70575-8_14zbMath1152.05372OpenAlexW1554128198WikidataQ59768697 ScholiaQ59768697MaRDI QIDQ3521916
Prasad Chebolu, Páll Melsted, Alan M. Frieze
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_14
Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time
