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
Journal ArticleDOI
Parameterized complexity of three edge contraction problems with degree constraints
TL;DR: The results imply that H-Contraction admits a linear vertex kernel on connected graphs when H is the class of cycles and the problem is expected not to admit a kernel at all.
Book ChapterDOI
A polynomial time algorithm for bounded directed pathwidth
TL;DR: A polynomial time algorithm for bounded directed pathwidth given a positive integer k and a digraph G with n vertices and m edges and constructs a directed path-decomposition of G of width k if one exists and otherwise reports the non-existence.
Posted Content
From Causes for Database Queries to Repairs and Model-Based Diagnosis and Back
Babak Salimi,Leopoldo Bertossi +1 more
TL;DR: This work establishes and investigates connections between causes for query answers in databases, database repairs with respect to denial constraints, and consistency-based diagnosis, and shows how to obtain database repairs from causes, and the other way around.
Book ChapterDOI
Parameterized Computational Complexity of Dodgson and Young Elections
TL;DR: It is shown that the computational complexity of the Dodgson and Young election systems is completely different from a parameterized complexity point of view, and it is proved that the corresponding problem for Young elections is W[2]-complete.
Proceedings Article
Going Beyond Primal Treewidth for {(M)ILP}
TL;DR: This work introduces and algorithmic exploitation of two new decompositional parameters for ILP and MILP, and obtains a full complexity landscape mapping the precise conditions under which incidence treewidth can be used to obtain efficient algorithms.