On some optimization problems on \(k\)-trees and partial \(k\)-trees
type: Item
instance of: scholarly article
title: On some optimization problems on \(k\)-trees and partial \(k\)-trees
zbMATH Open document ID: 0804.90123
DOI: 10.1016/0166-218X(92)00122-3
author: Daniel Granot
author: Darko Skorin-Kapov
published in: Discrete Applied Mathematics
publication date: 1994-03-10T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 513343
zbMATH Keywords: \(k\)-tree
zbMATH Keywords: \(k\)-complete graph
zbMATH Keywords: path distance optimization
MaRDI profile type: Publication
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Characterization and Recognition of Partial 3-Trees
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: Q4734761
cites work: Q4694755
cites work: Q3218070
cites work: Networks immune to isolated failures
cites work: Partitioning trees: Matching, domination, and maximum diameter
cites work: Computation of the center and diameter of outerplanar graphs
cites work: Networks immune to isolated line failures
cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
cites work: Q3328583
cites work: Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
cites work: Q3971521
cites work: Algorithms finding tree-decompositions of graphs
cites work: The most reliable series-parallel networks
cites work: Separating subgraphs in k-trees: Cables and caterpillars
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Steiner trees, partial 2–trees, and minimum IFI networks
Wikidata QID: Q126772600
description: scientific article; zbMATH DE number 513343