An optimal minimum spanning tree algorithm

  title={An optimal minimum spanning tree algorithm},
  author={Seth Pettie and V. Ramachandran},
  journal={J. ACM},
  • Seth Pettie, V. Ramachandran
  • Published 2002
  • Computer Science, Mathematics
  • J. ACM
  • We establish that the algorithmic complexity of the minimumspanning tree problem is equal to its decision-tree complexity.Specifically, we present a deterministic algorithm to find aminimum spanning tree of a graph with <i>n</i> vertices and<i>m</i> edges that runs in time<i>O</i>(<i>T</i><sup>*</sup>(<i>m,n</i>)) where<i>T</i><sup>*</sup> is the minimum number of edge-weightcomparisons needed to determine the solution. The algorithm isquite simple and can be implemented on a pointer machine… CONTINUE READING
    253 Citations
    Estimating the weight of metric minimum spanning trees in sublinear-time
    • 37
    • PDF
    Testing Euclidean minimum spanning trees in the plane
    • 9
    • PDF
    An Optimal Minimum Spanning Tree Algorithm
    • 11
    • PDF
    Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits
    • H. Lu
    • Mathematics, Computer Science
    • SODA '02
    • 2002
    • 32
    • Highly Influenced
    • PDF
    Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
    • 6
    • PDF
    Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
    • Seth Pettie
    • Computer Science, Mathematics
    • J. Graph Algorithms Appl.
    • 2015
    • 20
    • PDF
    Approximating the Minimum Spanning Tree Weight in Sublinear Time
    • 139
    • PDF
    Distributed verification of minimum spanning trees
    • 37
    Distributed verification of minimum spanning trees
    • 53
    • PDF