Two Algorithms for Generating Weighted Spanning Trees in Order
- 1 March 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 6 (1) , 139-150
- https://doi.org/10.1137/0206011
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- An 0(|E|loglog|V|) algorithm for finding minimum spanning treesInformation Processing Letters, 1975
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning TreesNetworks, 1975
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- A note on finding the bridges of a graphInformation Processing Letters, 1974
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path ProblemManagement Science, 1972
- Generation of Trees without DuplicationsIEEE Transactions on Circuit Theory, 1965
- A Simple Algorithm for Listing All the Trees of a GraphIEEE Transactions on Circuit Theory, 1965