scispace - formally typeset
Open AccessBook

Parameterized complexity theory

Jörg Flum, +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

The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover

Sounaka Mishra, +4 more
- 01 Dec 2011 - 
TL;DR: While studying the parameterized complexity of the problem of deleting k vertices to obtain a König-Egerváry graph, a number of interesting structural results on matchings and vertex covers are shown which could be useful in other contexts.
Journal ArticleDOI

Constant Delay Enumeration for Conjunctive Queries

Luc Segoufin
TL;DR: This work focuses on the case where the enumeration is performed with a constant delay between any two consecutive solutions, after a linear time preprocessing, about enumerating the answers to queries over a database.
Proceedings ArticleDOI

Large-treewidth graph decompositions and applications

Chandra Chekuri, +1 more
TL;DR: Two theorems on the tradeoff between the number of the desired subgraphs h, and the desired lower bound r on the treewidth of each subgraph are proved, which leads to substantially improved parameters in some Erdos-Posa-type results, and faster algorithms for some fixed-parameter tractable problems.
Journal ArticleDOI

Parameterized Complexity of 1-Planarity

Michael J. Bannister, +2 more
- 20 Apr 2013 - 
TL;DR: The parameterized complexity of the problem of finding a 1-planar drawing for a general graph is investigated with respect to the vertex cover number, tree-depth, and cyclomatic number, and fixed-parameter tractable algorithms are constructed.
Book ChapterDOI

Parameterized Complexity for Domination Problems on Degenerate Graphs

Petr A. Golovach, +1 more
TL;DR: The list of domination problems which are fixed-parameter tractable (FPT) for degenerate graphs is expanded by proving that Connected k -Dominating set and k - Dominating threshold set are FPT.