A randomized linear-time algorithm for finding minimum spanning trees
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

Philip N. Klein, Robert Endre Tarjan
A randomized linear-time algorithm for finding minimum spanning trees
STOC, 1994.

STOC 1994
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-1994-KleinT,
	author        = "Philip N. Klein and Robert Endre Tarjan",
	booktitle     = "{Proceedings of the 26th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/195058.195084",
	isbn          = "0-89791-663-8",
	pages         = "9--15",
	publisher     = "{ACM}",
	title         = "{A randomized linear-time algorithm for finding minimum spanning trees}",
	year          = 1994,
}

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.