The Bounded Path Tree Problem
- 1 December 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 3 (4) , 474-484
- https://doi.org/10.1137/0603048
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Complexity of spanning tree problems: Part IEuropean Journal of Operational Research, 1980
- Shortest-path problem is not harder than matrix multiplicationInformation Processing Letters, 1980
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path treesNetworks, 1979
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a GraphOperations Research, 1964
- A note on two problems in connexion with graphsNumerische Mathematik, 1959