The min-max spanning tree problem and some extensions
- 1 January 1978
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 7 (1) , 10-14
- https://doi.org/10.1016/0020-0190(78)90030-3
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Two Algorithms for Generating Weighted Spanning Trees in OrderSIAM Journal on Computing, 1977
- Finding optimum branchingsNetworks, 1977
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- Finding the medianJournal of Computer and System Sciences, 1976
- An 0(|E|loglog|V|) algorithm for finding minimum spanning treesInformation Processing Letters, 1975
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Computing minimum spanning trees efficientlyPublished by Association for Computing Machinery (ACM) ,1972