Efficient sets in partial \(k\)-trees

DOI10.1016/0166-218X(93)90226-EzbMath0787.68083MaRDI QIDQ686252

Jan Arne Telle, Andrzej Proskurowski

Publication date: 30 November 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

partial \(k\)-treeefficient dominating set

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

Restrained and Total Restrained Domination in Graphs ⋮ Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient sets in graphs
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Algorithms finding tree-decompositions of graphs
• Steiner trees, partial 2–trees, and minimum IFI networks
• Easy problems for tree-decomposable graphs
• Characterization and Recognition of Partial 3-Trees
• Graph minors. II. Algorithmic aspects of tree-width
• Recursive Graphs, Recursive Labelings and Shortest Paths

This page was built for publication: Efficient sets in partial \(k\)-trees