Perfect Matchings in Õ (n1.5) Time in Regular Bipartite Graphs
Crossref DOI link: https://doi.org/10.1007/s00493-015-2653-6
Published Online: 2018-11-28
Published Print: 2019-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Goel, Ashish
Kapralov, Michael
Khanna, Sanjeev
Text and Data Mining valid from 2018-11-28
Article History
Received: 23 July 2009
Revised: 17 March 2014
First Online: 28 November 2018