Perfect matchings in \(\tilde{O}(n^{1.5})\) time in regular bipartite graphs
From MaRDI portal
Publication:2322505
DOI10.1007/S00493-015-2653-6zbMATH Open1449.68046OpenAlexW2903540361MaRDI QIDQ2322505
Sanjeev Khanna, Ashish Goel, Michael Kapralov
Publication date: 4 September 2019
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-015-2653-6
Analysis of algorithms and problem complexity (68Q25) 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)
This page was built for publication: Perfect matchings in \(\tilde{O}(n^{1.5})\) time in regular bipartite graphs
