Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
Harold N. Gabow, Zvi Galil, Thomas H. Spencer et al. · COMBINATORICA · 1986
Cited by 517 works. doi:10.1007/bf02579168
Authors
References
- Data Structures and Network Algorithms
- Efficiency of a Good But Not Linear Set Union Algorithm
- Finding Minimum Spanning Trees
- Optimum branchings
- An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
- Applications of Path Compression on Balanced Trees
- Amortized Computational Complexity
- Finding optimum branchings
- Worst-case Analysis of Set Union Algorithms
- On the History of the Minimum Spanning Tree Problem