Efficient sets in partial k-trees

DOI10.1016/0166-218X(93)90226-EzbMATH Open0787.68083MaRDI QIDQ686252FDOQ686252

Jan Arne Telle, Andrzej Proskurowski

Publication date: 30 November 1993

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

Recommendations

• Efficient sets in graphs
• The efficiency of AC graphs
• scientific article; zbMATH DE number 5080622
• scientific article
• On the efficiency index of a graph

zbMATH Keywords

efficient dominating setpartial \(k\)-tree

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)

Cites Work

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

Cited In (5)

• Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
• Efficient sets in graphs
• \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms
• The efficiency of AC graphs
• Restrained and Total Restrained Domination in Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686252)