Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs
From MaRDI portal
Publication:2848226
DOI10.1137/100812513zbMath1272.68154OpenAlexW2079485638MaRDI QIDQ2848226
Sanjeev Khanna, Ashish Goel, Michael Kapralov
Publication date: 25 September 2013
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100812513
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Optimum distance flag codes from spreads via perfect matchings in graphs ⋮ The optimal tenement allocation for reducing traffic burden ⋮ MAXIMUM MATCHINGS IN A PSEUDOFRACTAL SCALE-FREE WEB ⋮ Unnamed Item ⋮ Fair-by-design matching ⋮ On Rearrangement of Items Stored in Stacks ⋮ Recomputing causality assignments on lumped process models when adding new simplification assumptions
This page was built for publication: Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs
