On some optimization problems on k-trees and partial k-trees
- 1 January 1994
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 48 (2) , 129-145
- https://doi.org/10.1016/0166-218x(92)00122-3
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Characterization and Recognition of Partial 3-TreesSIAM Journal on Algebraic Discrete Methods, 1986
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Networks immune to isolated line failuresNetworks, 1982
- Networks immune to isolated failuresNetworks, 1981
- Partitioning trees: Matching, domination, and maximum diameterInternational Journal of Parallel Programming, 1981
- Computation of the center and diameter of outerplanar graphsDiscrete Applied Mathematics, 1980
- Minimax Location of a Facility in an Undirected Tree GraphTransportation Science, 1973
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972