A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees

David R. Karger; Philip N. Klein; Robert E. Tartan

doi:10.1145/201019.201022

A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees

David R. Karger, Philip N. Klein, Robert E. Tartan

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

Original language	English (US)
Pages (from-to)	321-328
Number of pages	8
Journal	Journal of the ACM (JACM)
Volume	42
Issue number	2
DOIs	https://doi.org/10.1145/201019.201022
State	Published - Jan 3 1995
Externally published	Yes

All Science Journal Classification (ASJC) codes

Software
Control and Systems Engineering
Information Systems
Hardware and Architecture
Artificial Intelligence

Access to Document

10.1145/201019.201022

Cite this

@article{6545e73b4ca641acb5273d410b3bbea0,

title = "A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees",

author = "Karger, {David R.} and Klein, {Philip N.} and Tartan, {Robert E.}",

year = "1995",

month = jan,

day = "3",

doi = "10.1145/201019.201022",

language = "English (US)",

volume = "42",

pages = "321--328",

journal = "Journal of the ACM",

issn = "0004-5411",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

}

TY - JOUR

T1 - A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees

AU - Karger, David R.

AU - Klein, Philip N.

AU - Tartan, Robert E.

PY - 1995/1/3

Y1 - 1995/1/3

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

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

U2 - 10.1145/201019.201022

DO - 10.1145/201019.201022

M3 - Article

AN - SCOPUS:0029276335

SN - 0004-5411

VL - 42

SP - 321

EP - 328

JO - Journal of the ACM

JF - Journal of the ACM

IS - 2

ER -

A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this