A randomized linear-time algorithm to find minimum spanning trees Export

@article{citeulike:2316798, address = {New York, NY, USA}, author = {Karger, David R. and Klein, Philip N. and Tarjan, Robert E.}, citeulike-article-id = {2316798}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=201019.201022}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/201019.201022}, doi = {10.1145/201019.201022}, issn = {0004-5411}, journal = {J. ACM}, keywords = {algorithms, minimum, randomized, spanning, trees}, month = {March}, number = {2}, pages = {321--328}, posted-at = {2008-01-31 23:06:52}, priority = {2}, publisher = {ACM}, title = {A randomized linear-time algorithm to find minimum spanning trees}, url = {http://dx.doi.org/10.1145/201019.201022}, volume = {42}, year = {1995} }

TY - JOUR ID - citeulike:2316798 L3 - citeulike-article-id:2316798 IS - 2 JF - J. ACM SN - 0004-5411 AD - New York, NY, USA EP - 328 TI - A randomized linear-time algorithm to find minimum spanning trees PB - ACM VL - 42 SP - 321 KW - algorithms KW - minimum KW - randomized KW - spanning KW - trees AU - Karger, David AU - Klein, Philip AU - Tarjan, Robert PY - 1995/03// UR - http://dx.doi.org/10.1145/201019.201022 ER -