Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time
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

Prasad Chebolu, Alan M. Frieze, Páll Melsted
Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time
ICALP, 2008.

ICALP A 2008
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-A-2008-CheboluFM,
	author        = "Prasad Chebolu and Alan M. Frieze and Páll Melsted",
	booktitle     = "{Proceedings of the 35th International Colloquium on Automata, Languages and Programming, Track A: Algorithms, Automata, Complexity, and Games}",
	doi           = "10.1007/978-3-540-70575-8_14",
	isbn          = "978-3-540-70574-1",
	pages         = "161--172",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time}",
	volume        = 5125,
	year          = 2008,
}

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.