Perfect Matchings in O(nlog n) Time in Regular Bipartite Graphs

Ashish Goel, Michael Kapralov, Sanjeev Khanna. Perfect Matchings in O(nlog n) Time in Regular Bipartite Graphs. SIAM Journal on Computing, 42(3):1392-1404, 2013. [doi]

@article{GoelKK13,
  title = {Perfect Matchings in O(nlog n) Time in Regular Bipartite Graphs},
  author = {Ashish Goel and Michael Kapralov and Sanjeev Khanna},
  year = {2013},
  doi = {10.1137/100812513},
  url = {http://dx.doi.org/10.1137/100812513},
  researchr = {https://researchr.org/publication/GoelKK13},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {42},
  number = {3},
  pages = {1392-1404},
}