scientific article; zbMATH DE number 6866304
From MaRDI portal
Publication:4638063
DOI10.4230/LIPIcs.ITCS.2017.14zbMath1402.68091arXiv1511.04479MaRDI QIDQ4638063
Publication date: 3 May 2018
Full work available at URL: https://arxiv.org/abs/1511.04479
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Fundamentals of parameterized complexity
- Boolean-width of graphs
- Graph minors. III. Planar tree-width
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- Constrained-path labellings on graphs of bounded clique-width
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Handle-rewriting hypergraph grammars
- Counting truth assignments of formulas of bounded tree-width or clique-width
- Approximating clique-width and branch-width
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- Clique-width minimization is NP-hard
- Between Treewidth and Clique-Width
- Fusion in relational structures and the verification of monadic second-order properties
- Complexity of Finding Embeddings in a k-Tree
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Approximating rank-width and clique-width quickly
- On the Relationship Between Clique-Width and Treewidth
- A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Finding Branch-Decompositions and Rank-Decompositions
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
This page was built for publication:
