Problems with generalized steiner problems
- 1 June 1992
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 7 (1-6) , 333-335
- https://doi.org/10.1007/bf01758767
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Dynamic programming on graphs with bounded treewidthPublished by Springer Nature ,1988
- Steiner problem in Halin networksDiscrete Applied Mathematics, 1987
- The NP-completeness of steiner tree and dominating set for chordal bipartite graphsTheoretical Computer Science, 1987
- Generalized steiner problem in series-parallel networksJournal of Algorithms, 1986
- Chordality properties on graphs and minimal conceptual connections in semantic data modelsJournal of Computer and System Sciences, 1986
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- Generalized steiner problem in outerplanar networksBIT Numerical Mathematics, 1985
- Steiner trees, connected domination and strongly chordal graphsNetworks, 1985
- Steiner trees, partial 2–trees, and minimum IFI networksNetworks, 1983
- Linear-time computability of combinatorial problems on series-parallel graphsJournal of the ACM, 1982