Two algorithms for the subset interconnection design problem
- 1 July 1992
- Vol. 22 (4) , 385-395
- https://doi.org/10.1002/net.3230220406
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Matroids and Subset Interconnection DesignSIAM Journal on Discrete Mathematics, 1988
- An optimization problem on graphsDiscrete Applied Mathematics, 1986
- On the History of the Minimum Spanning Tree ProblemIEEE Annals of the History of Computing, 1985
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic HypergraphsSIAM Journal on Computing, 1984
- Decomposable graphs and hypergraphsJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1984
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- Hypergraphes arboresDiscrete Mathematics, 1978
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956