Combinatorica

, Volume 6, Issue 2, pp 109–122

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Authors

  • Harold N. Gabow
    • University of Colorado
  • Zvi Galil
    • Columbia University
    • Tel Aviv University
  • Thomas Spencer
    • Rensselaer Polytechnic Inst.
  • Robert E. Tarjan
    • AT&T Bell Laboratories
Article

DOI: 10.1007/BF02579168

Cite this article as:
Gabow, H.N., Galil, Z., Spencer, T. et al. Combinatorica (1986) 6: 109. doi:10.1007/BF02579168

Abstract

Recently, Fredman and Tarjan invented a new, especially efficient form of heap (priority queue). Their data structure, theFibonacci heap (or F-heap) supports arbitrary deletion inO(logn) amortized time and other heap operations inO(1) amortized time. In this paper we use F-heaps to obtain fast algorithms for finding minimum spanning trees in undirected and directed graphs. For an undirected graph containingn vertices andm edges, our minimum spanning tree algorithm runs inO(m logβ (m, n)) time, improved fromO((m, n)) time, whereβ(m, n)=min {i|log(i)nm/n}. Our minimum spanning tree algorithm for directed graphs runs inO(n logn + m) time, improved fromO(n log n +m log log log(m/n+2)n). Both algorithms can be extended to allow a degree constraint at one vertex.

AMS subject classification (1980)

68 B 1568 C 05

Copyright information

© Akadémiai Kiadó 1986