An Optimal Minimum Spanning Tree Algorithm

@inproceedings{Pettie2000AnOM,
  title={An Optimal Minimum Spanning Tree Algorithm},
  author={Seth Pettie and Vijaya Ramachandran},
  booktitle={ICALP},
  year={2000}
}
Weestablishthatthealgorithmiccomplexity of theminimumspanningtreeproblemisequal to its decision-treecomplexity. Specifically, wepresentadeterministicalgorithmto find aminimum spanningtreeof a graphwith n verticesandm edgesthatrunsin time O(T ∗(m, n)) whereT ∗ is the minimum numberof edge-weightcomparisonsneededto determinethe solution.The algorithmis quitesimpleandcanbeimplementedonapointermachine. Althoughour timeboundis optimal,theexactfunctiondescribingit is not known atpresent.The… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, and topics from this paper.
126 Citations
28 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 126 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Concurrentthreadsand optimal parallel minimum spanningtreesalgorithm

  • E. W. D IJKSTRA
  • J . ACM
  • 2001

Concurrentthreadsand optimal parallel minimum spanningtreesalgorithm.J

  • W CHONGK., Y HAN, LAM, T W.
  • ACM 48,
  • 2001

Thesoftheap:An approximatepriority queuewith optimalerrorrate.J

  • B. CHAZELLE
  • ACM 47,
  • 2000
3 Excerpts

Findingminimumspanningtreesin O(mα(m, n)) time.Tech.Rep.TR99-23.Univ. of TexasatAustin, Austin,Tex

  • S. PETTIE
  • 1999

Linear - time pointermachinealgorithmsfor leastcommonancestors , MST verification , anddominators

  • A. L. B UCHSBAUM, H. K APLAN, A. R OGERS, J. R. W ESTBROOK
  • 1998

A fasterdeterministicalgorithmfor minimumspanningtrees

  • B. C HAZELLE
  • Proceedingsof the IEEE Symposiumon Foundationsof…
  • 1997

Similar Papers

Loading similar papers…