A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
Reads0
Chats0
TLDR
Every minor-closed class of graphs that does not contain all planar graphs has a linear-time recognition algorithm that determines whether the treewidth of G is at most at most some constant $k$ and finds a tree-decomposition of G withtreewidth at most k.Abstract:
In this paper, we give for constant $k$ a linear-time algorithm that, given a graph $G=(V,E)$, determines whether the treewidth of $G$ is at most $k$ and, if so, finds a tree-decomposition of $G$ with treewidth at most $k$. A consequence is that every minor-closed class of graphs that does not contain all planar graphs has a linear-time recognition algorithm. Another consequence is that a similar result holds when we look instead for path-decompositions with pathwidth at most some constant $k$.read more
Citations
More filters
Book
Invitation to fixed-parameter algorithms
TL;DR: This paper discusses Fixed-Parameter Algorithms, Parameterized Complexity Theory, and Selected Case Studies, and some of the techniques used in this work.
Book
Elements of Finite Model Theory
TL;DR: This book describes applications in databases, complexity theory, and formal languages, as well as other branches of computer science, and highlights the computer science aspects of the subject.
Journal ArticleDOI
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
TL;DR: It is proved that this is also the case for graphs of clique-width at most k, where this complexity measure is associated with hierarchical decompositions of another type, and where logical formulas are no longer allowed to use edge set quantifications.
Journal ArticleDOI
On problems without polynomial kernels
TL;DR: Using the notion of distillation algorithms, a generic lower-bound engine is developed that allows showing that a variety of FPT problems, fulfilling certain criteria, cannot have polynomial kernels unless the polynomially-bounded hierarchy collapses.
Journal ArticleDOI
A survey of graph layout problems
TL;DR: A complete view of the current state of the art with respect to layout problems from an algorithmic point of view is presented.
References
More filters
Journal ArticleDOI
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
TL;DR: Every set of finite graphs, that is definable in monadic second-order logic is recognizable, but not vice versa, and the monadicsecond-order theory of a context-free set of graphs is decidable.
Journal ArticleDOI
Easy problems for tree-decomposable graphs
TL;DR: Using a variation of the interpretability concept, it is shown that all graph properties definable in monadic second-order logic with quantification over vertex and edge sets can be decided in linear time for classes of graphs of fixed bounded treewidth given a tree-decomposition.
Book
Treewidth: Computations and Approximations
TL;DR: Testing superperfection of k-trees and triangulating 3-colored graphs results in approximating treewidth and pathwidth for some classes of perfect graphs.
Book ChapterDOI
CHAPTER 1 – Finite Automata
TL;DR: The field of finite automata is a branch of mathematics connected with the algebraic theory of semigroups and associative algebras as discussed by the authors, which is one of the most important areas of automata research.