scientific article; zbMATH DE number 176762

zbMATH Open0764.68108MaRDI QIDQ4036592FDOQ4036592

Authors: Ton Kloks, Hans L. Bodlaender 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
• scientific article; zbMATH DE number 566078
• Faster computation of path-width
• An improved algorithm for finding tree decompositions of small width
• scientific article

zbMATH Keywords

algorithmstreewidthpathwidthtree-decompositionpath-decomposition

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (31)

• Computing Pathwidth Faster Than 2 n
• Efficient sets in partial \(k\)-trees
• A simple linear time algorithm for triangulating three-colored graphs
• Complexity of path-forming games
• Parallel algorithms with optimal speedup for bounded treewidth
• The Pathwidth and Treewidth of Cographs
• Scheduling with incompatible jobs
• Mixed searching and proper-path-width
• Minor-Closed Graph Classes with Bounded Layered Pathwidth
• Approximation algorithms for treewidth
• Kernelization using structural parameters on sparse graph classes
• A lower bound for treewidth and its consequences
• Title not available (Why is that?)
• Approximate tree decompositions of planar graphs in linear time
• Computing Tree Decompositions
• Narrowness, pathwidth, and their application in natural language processing
• The pathwidth and treewidth of cographs
• Tree-width and path-width of comparability graphs of interval orders
• The complexity of broadcasting in planar and decomposable graphs
• The complexity of broadcasting in planar and decomposable graphs
• Better \(s-t\)-tours by Gao trees
• Treewidth and pathwidth of permutation graphs
• An improved parameterized algorithm for treewidth
• Testing superperfection of k-trees
• Pathwidth of cubic graphs and exact algorithms
• Nondeterministic graph searching: from pathwidth to treewidth
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two strikes against perfect phylogeny
• A simple linear-time algorithm for finding path-decompositions of small width
• Peptide sequencing via graph path decomposition

This page was built for publication:

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