Perfect Matchings in Õ (n 1.5) Time in Regular Bipartite Graphs

Ashish Goel; Michael Kapralov; Sanjeev Khanna

doi:10.1007/s00493-015-2653-6

Perfect Matchings in Õ (n 1.5) Time in Regular Bipartite Graphs

Ashish Goel, Michael Kapralov, Sanjeev Khanna

Research output: Contribution to journal › Article › peer-review

Original language	English (US)
Pages (from-to)	323-354
Number of pages	32
Journal	Combinatorica
Volume	39
Issue number	2
DOIs	https://doi.org/10.1007/s00493-015-2653-6
State	Published - Nov 28 2018
Externally published	Yes

Bibliographical note

KAUST Repository Item: Exported on 2022-06-09
Acknowledgements: Research supported by NSF ITR grant 0428868, NSF CAREER award 0339262, and a grant from the Stanford-KAUST alliance for academic excellence. Research supported by a Stanford Graduate Fellowship. Supported in part by a Guggenheim Fellowship, an IBM Faculty Award, and by NSF Award CCF-0635084.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Computational Mathematics

Access to Document

10.1007/s00493-015-2653-6

Cite this

@article{3515a50c20394ef7aea6f71f11272296,

title = "Perfect Matchings in {\~O} (n 1.5) Time in Regular Bipartite Graphs",

author = "Ashish Goel and Michael Kapralov and Sanjeev Khanna",

note = "KAUST Repository Item: Exported on 2022-06-09 Acknowledgements: Research supported by NSF ITR grant 0428868, NSF CAREER award 0339262, and a grant from the Stanford-KAUST alliance for academic excellence. Research supported by a Stanford Graduate Fellowship. Supported in part by a Guggenheim Fellowship, an IBM Faculty Award, and by NSF Award CCF-0635084. This publication acknowledges KAUST support, but has no KAUST affiliated authors.",

year = "2018",

month = nov,

day = "28",

doi = "10.1007/s00493-015-2653-6",

language = "English (US)",

volume = "39",

pages = "323--354",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "2",

}

TY - JOUR

T1 - Perfect Matchings in Õ (n 1.5) Time in Regular Bipartite Graphs

AU - Goel, Ashish

AU - Kapralov, Michael

AU - Khanna, Sanjeev

N1 - KAUST Repository Item: Exported on 2022-06-09 Acknowledgements: Research supported by NSF ITR grant 0428868, NSF CAREER award 0339262, and a grant from the Stanford-KAUST alliance for academic excellence. Research supported by a Stanford Graduate Fellowship. Supported in part by a Guggenheim Fellowship, an IBM Faculty Award, and by NSF Award CCF-0635084. This publication acknowledges KAUST support, but has no KAUST affiliated authors.

PY - 2018/11/28

Y1 - 2018/11/28

UR - http://hdl.handle.net/10754/678811

UR - http://link.springer.com/10.1007/s00493-015-2653-6

UR - http://www.scopus.com/inward/record.url?scp=85057568405&partnerID=8YFLogxK

U2 - 10.1007/s00493-015-2653-6

DO - 10.1007/s00493-015-2653-6

M3 - Article

SN - 0209-9683

VL - 39

SP - 323

EP - 354

JO - Combinatorica

JF - Combinatorica

IS - 2

ER -

Perfect Matchings in Õ (n 1.5) Time in Regular Bipartite Graphs

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this