Steiner trees, connected domination and strongly chordal graphs
- 1 March 1985
- Vol. 15 (1) , 109-124
- https://doi.org/10.1002/net.3230150109
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Characterizations of totally balanced matricesJournal of Algorithms, 1984
- Steiner trees, partial 2–trees, and minimum IFI networksNetworks, 1983
- A linear algorithm for the domination number of a series-parallel graphDiscrete Applied Mathematics, 1983
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- Topology of series-parallel networksJournal of Mathematical Analysis and Applications, 1965
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961