Optimum Communication Spanning Trees
- 1 September 1974
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 3 (3), 188-195
- https://doi.org/10.1137/0203015
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Optimal Linear OrderingSIAM Journal on Applied Mathematics, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock ProblemCanadian Journal of Mathematics, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956