Open AccessBook
Parameterized complexity theory
Jörg Flum,Martin Grohe +1 more
TLDR
Fixed-Parameter Tractability.Abstract:
Fixed-Parameter Tractability.- Reductions and Parameterized Intractability.- The Class W[P].- Logic and Complexity.- Two Fundamental Hierarchies.- The First Level of the Hierarchies.- The W-Hierarchy.- The A- Hierarchy.- Kernelization and Linear Programming Techniques.- The Automata-Theoretic Approach.- Tree Width.- Planarity and Bounded Local Tree Width.- Homomorphisms and Embeddings.- Parameterized Counting Problems.- Bounded Fixed-Parameter Tractability.- Subexponential Fixed-Parameter Tractability.- Appendix, Background from Complexity Theory.- References.- Notation.- Index.read more
Citations
More filters
Posted Content
Planar Subgraph Isomorphism Revisited
TL;DR: In this article, the authors improved the running time of Eppstein's algorithm to 2^O(k) n by exploiting the topology of the underlying embeddings of the subgraph pattern.
Journal ArticleDOI
Separator-based data reduction for signed graph balancing
TL;DR: This work uses a fixed-parameter algorithm based on iterative compression with a very effective heuristic speedup to solve the NP-hard Balanced Subgraph problem, which asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels.
Proceedings ArticleDOI
Linear kernels for (connected) dominating set on H-minor-free graphs
TL;DR: The first linear kernels forDominating Set and Connected Dominating Set problems on graphs excluding a fixed graph H as a minor are given, based on a novel generic reduction rule producing an equivalent instance of the problem with treewidth O(√k) such that G has a (connected) dominating set of size k if and only if G' has.
Book ChapterDOI
The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration
TL;DR: This work shows that the more general problem of l-length bounded reconfiguration of constraint satisfaction problems (CSPs) is fixed-parameter tractable parameterized by k+l+r, where r is the maximum constraint arity and k is themaximum domain size.
Posted Content
Parameterized Algorithms for Modular-Width
TL;DR: In this article, the authors consider a parameter called modular-width, defined using the well-known notion of modular decompositions, and use a combination of ILP and dynamic programming to find a different structural graph parameter which is as general as possible, covers dense graphs but does not incur such a heavy algorithmic penalty.