On finding steiner vertices
- 1 September 1986
- Vol. 16 (3), 283-294
- https://doi.org/10.1002/net.3230160305
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- An algorithm for the steiner problem in graphsNetworks, 1984
- STEINER PROBLEMS IN GRAPHS: ALGORITHMS AND APPLICATIONSEngineering Optimization, 1983
- The computation of nearly minimal Steiner trees in graphsInternational Journal of Mathematical Education in Science and Technology, 1983
- An algorithm for the steiner problem in graphsNetworks, 1982
- The Complexity of Computing Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1977
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- Steiner's problem in graphs and its implicationsNetworks, 1971
- The steiner problem in graphsNetworks, 1971
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956