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

Ashish Goel, Michael Kapralov, Sanjeev Khanna (2013)

> Home

Details and statistics

DOI: 10.1137/100812513

access: closed

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/GoelKK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/GoelKK13
Ashish Goel, Michael Kapralov, Sanjeev Khanna:
Perfect Matchings in O(nlog n) Time in Regular Bipartite Graphs. SIAM J. Comput. 42(3): 1392-1404 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.