The tree-width of C

DOI10.1016/J.DAM.2019.01.027MaRDI QIDQ2174562zbMATH OpenOpenAlexFDO

Authors Philipp Klaus Krause, Lukas Larisch, Felix Salfelder

Publication date 21 April 2020

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

Full work available at URL https://doi.org/10.1016/j.dam.2019.01.027

zbMATH Keywords

Cstructured programstree-decompositiontree-width

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Theory of compilers and interpreters (68N20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1926662
• Minimum size tree-decompositions
• scientific article; zbMATH DE number 1107741
• Jdrasil: a modular library for computing tree decompositions
• Treewidth computations. I: Upper bounds

Cites work

• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• A practical algorithm for making filled graphs minimal
• All structured programs have small tree width and good register allocation
• Characterization and Recognition of Partial 3-Trees
• Easy problems for tree-decomposable graphs
• Flow diagrams, turing machines and languages with only two formation rules
• Generalized dominators for structured programs
• Graph minors. II. Algorithmic aspects of tree-width
• Graph minors. III. Planar tree-width
• Graph minors. XIII: The disjoint paths problem
• scientific article; zbMATH DE number 3471564 (Why is no real title available?)
• scientific article; zbMATH DE number 1303600 (Why is no real title available?)
• scientific article; zbMATH DE number 1926662 (Why is no real title available?)
• scientific article; zbMATH DE number 910892 (Why is no real title available?)
• Safe reduction rules for weighted treewidth
• The complexity of first-order and monadic second-order logic revisited
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
• Treewidth computations. I: Upper bounds
• Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner

Cited in

(2)

• Tree-Width for First Order Formulae
• scientific article; zbMATH DE number 1926662 (Why is no real title available?)

Describes a project that uses

Uses Software

• Dhrystone
• ComputeTW

This page was built for publication: The tree-width of C

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