Steiner problem in Halin networks
- 30 June 1987
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 17 (3) , 281-294
- https://doi.org/10.1016/0166-218x(87)90031-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Characterization and Recognition of Partial 3-TreesSIAM Journal on Algebraic Discrete Methods, 1986
- Halin graphs and the travelling salesman problemMathematical Programming, 1983
- Steiner trees, partial 2–trees, and minimum IFI networksNetworks, 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
- A fast algorithm for Steiner treesActa Informatica, 1981
- An integer linear programming approach to the steiner problem in graphsNetworks, 1980
- Une heuristique pour le problème de l'arbre de SteinerRairo-Operations Research, 1978
- Steiner's problem in graphs and its implicationsNetworks, 1971
- The steiner problem in graphsNetworks, 1971