Generating the maximum spanning trees of a weighted graph
- 31 December 1987
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 8 (4) , 592-597
- https://doi.org/10.1016/0196-6774(87)90053-8
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic HypergraphsSIAM Journal on Computing, 1984
- Syntactic Characterization of Tree Database SchemasJournal of the ACM, 1983
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- Power of Natural SemijoinsSIAM Journal on Computing, 1981
- Two Algorithms for Generating Weighted Spanning Trees in OrderSIAM Journal on Computing, 1977
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning TreesNetworks, 1975
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- A Simple Algorithm for Listing All the Trees of a GraphIEEE Transactions on Circuit Theory, 1965