A randomized linear-time algorithm to find minimum spanning trees-Reference-Cited by-同舟云学术

A randomized linear-time algorithm to find minimum spanning trees

Published:1995-03 Issue:2 Volume:42 Page:321-328
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Karger David R.¹,Klein Philip N.²,Tarjan Robert E.³

Affiliation:

1. Stanford Univ., Stanford, CA

2. Brown Univ., Providence, RI

3. Princeton Univ., Princeton, NJ; and NEC Research Institute, Princeton, NJ

Abstract

We present a randomized linear-time algorithm to find a minimum spanning tree in a connected graph with edge weights. The algorithm uses random sampling in combination with a recently discovered linear-time algorithm for verifying a minimum spanning tree. Our computational model is a unit-cost random-access machine with the restriction that the only operations allowed on edge weights are binary comparisons.

Publisher

Association for Computing Machinery (ACM)

Subject

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

Link

https://dl.acm.org/doi/pdf/10.1145/201019.201022

Reference23 articles.

1. ~BOR0VKA O. 1926. O jistdm probl~mu minimfdnfm. Pr~ca Moravskd P~irodoL ~deckd Spole6nosti ~3 37 58. (In Czech.) ~BOR0VKA O. 1926. O jistdm probl~mu minimfdnfm. Pr~ca Moravskd P~irodoL ~deckd Spole6nosti ~3 37 58. (In Czech.)

2. A measure of the asymptotic efficiency for tests of a hypothesis based on ~the sum of observations;~HERNOFF H.;Anm Math. Stat.,1952

Cited by 256 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. CLOi-Mapper: Consistent, Lightweight, Robust, and Incremental Mapper With Embedded Systems for Commercial Robot Services;IEEE Robotics and Automation Letters;2024-09

2. Connected Components in Linear Work and Near-Optimal Time;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

3. Log Diameter Rounds MST Verification and Sensitivity in MPC;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

4. Minimum Cut in $$O(m\log ^2 n)$$ Time;Theory of Computing Systems;2024-06-12

5. Hop-Constrained Oblivious Routing Using Prim’s-Sollin’s Algorithm;Lecture Notes on Data Engineering and Communications Technologies;2024