• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

An optimal minimum spanning tree algorithm (2000)

Cached

  • Download as a PDF

Download Links

  • [www.eecs.umich.edu]
  • [www.cs.princeton.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Seth Pettie , Vijaya Ramachandran
Venue:J. ACM
Citations:37 - 9 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Pettie00anoptimal,
    author = {Seth Pettie and Vijaya Ramachandran},
    title = {An optimal minimum spanning tree algorithm},
    journal = {J. ACM},
    year = {2000},
    volume = {49},
    pages = {49--60}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Abstract. We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to find a minimum spanning tree of a graph with n vertices and m edges that runs in time O(T ∗ (m, n)) where T ∗ is the minimum number of edge-weight comparisons needed to determine the solution. The algorithm is quite simple and can be implemented on a pointer machine. Although our time bound is optimal, the exact function describing it is not known at present. The current best bounds known for T ∗ are T ∗ (m, n) = �(m) and T ∗ (m, n) = O(m · α(m, n)), where α is a certain natural inverse of Ackermann’s function. Even under the assumption that T ∗ is superlinear, we show that if the input graph is selected from Gn,m, our algorithm runs in linear time with high probability, regardless of n, m, or the permutation of edge weights. The analysis uses a new martingale for Gn,m similar to the edge-exposure martingale for Gn,p.

Citations

2172 The design and analysis of computer algorithms - Aho, Hopcroft, et al. - 1974
1478 The probabilistic method - Spencer - 1992
1346 Renyi A: On the evolution of random graphs - Erdos - 1960
1011 A note on two problems in connexion with graphs. Numerische Mathematik 1: 269–271 - Dijkstra - 1959
493 Fibonacci heaps and their uses in improved network optimization algorithms - Fredman, Tarjan - 1987
406 RC: Shortest connection networks and some generalizations - Prim
141 Trans-dichotomous algorithms for minimum spanning trees and shortest paths - Fredman, Willard - 1990
98 A randomized lineartime algorithm to find minimum spanning trees - Karger, Klein, et al. - 1995
76 A class of algorithms which require nonlinear time to maintain disjoint sets - Tarjan - 1979
69 Efficient algorithms for finding minimum spanning trees in undirected and directed graphs - Gabow, Rarjan - 1986
59 A minimum spanning tree algorithm with inverse-ackermann type complexity - Chazelle
48 Verification and sensitivity analysis of minimum spanning trees in linear time - Dixon, Rauch, et al. - 1992
26 Linear-time pointer-machine algorithms for least common ancestors, mst verification, and dominators - Buchsbaum, Kaplan, et al. - 1998
12 A deterministic algorithm for minimum spanning trees - Chazelle - 1997
12 On the history of the minimum spanning tree problem. Annals of the History of Computing 7 - Graham, Hell - 1985
11 A randomized time-work optimal parallel algorithm for finding a minimum spanning forest - Pettie, Ramachandran - 1999
6 Linear expected-time algorithms for connectivity problems - Karp, Tarjan - 1980
5 On the parallel time complexity of undirected connectivity and minimum spanning trees - Chong, Han, et al. - 1999
3 O jist'em probl'emu minima'aln ' im. Moravsk'e Pr ' irodovedeck'e Spolecnosti 3 - Boruvka - 1926
3 ik. O jist'em probl'emu minima'aln ' im. Moravsk'e Pr ' irodovedeck'e Spolecnosti 6 - Jarn - 1930
3 An optimal algorithm with unknown time complexity for convex matrix searching - Larmore - 1990
2 Car-pooling as a data structuring device: The soft heap - Chazelle - 1998
2 Finding minimum spanning trees in O(mff(m; n)) time - Pettie - 1999
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University