Generalized steiner problem in outerplanar networks
- 1 September 1985
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 25 (3) , 485-496
- https://doi.org/10.1007/bf01935369
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Steiner trees, partial 2–trees, and minimum IFI networksNetworks, 1983
- Linear Algorithms for Isomorphism of Maximal Outerplanar GraphsJournal of the ACM, 1979
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Steiner's problem in graphs and its implicationsNetworks, 1971
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Bi-Path Networks and Multicommodity FlowsIEEE Transactions on Circuit Theory, 1964
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956