"A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees."

David R. Karger, Philip N. Klein, Robert Endre Tarjan (1995)

> Home

Details and statistics

DOI: 10.1145/201019.201022

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/KargerKT95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/KargerKT95
David R. Karger, Philip N. Klein, Robert Endre Tarjan:
A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees. J. ACM 42(2): 321-328 (1995)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.