Perfect matchings in o(n log n) time in regular bipartite graphs
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Ashish Goel, Michael Kapralov, Sanjeev Khanna
Perfect matchings in o(n log n) time in regular bipartite graphs
STOC, 2010.

STOC 2010
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-2010-GoelKK,
	author        = "Ashish Goel and Michael Kapralov and Sanjeev Khanna",
	booktitle     = "{Proceedings of the 42nd Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/1806689.1806696",
	isbn          = "978-1-4503-0050-6",
	pages         = "39--46",
	publisher     = "{ACM}",
	title         = "{Perfect matchings in o(n log n) time in regular bipartite graphs}",
	year          = 2010,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.