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
Book ChapterDOI

Constant thresholds can make target set selection tractable

Morgan Chopin, +3 more
TL;DR: In this paper, the authors show that upper bounding the thresholds by a constant may significantly alleviate the search for efficiently solvable, but still meaningful special cases of target set selection.
Book ChapterDOI

Graph operations characterizing rank-width and balanced graph expressions

Bruno Courcelle, +1 more
TL;DR: A unique theorem is given that generalizes several "balancing theorems" for tree-width and clique-width that are obtained from algebraic operations on graphs that characterize rank-width.
Book ChapterDOI

Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects

Bruno Courcelle
TL;DR: This informal overview presents the main definitions, results and open problems of graph structure and tries to answer some frequently asked questions.
Journal ArticleDOI

Increasing the lifetime of sensor networks by a data dissemination model based on a new approximation algorithm

Ramin Yarinezhad, +1 more
TL;DR: A cluster-based routing protocol for WSNs that solves LBCP with an fpt-approximation algorithm that has an approximation factor of 1.1, which means it is significantly more precise than the previous approximation factors reported for this problem.
Proceedings ArticleDOI

Linear time parameterized algorithms via skew-symmetric multicuts

M. S. Ramanujan, +1 more
TL;DR: The first fixed-parameter tractable algorithm for this problem was given by Kawarabayashi et al. as mentioned in this paper, running in time O((4d)k(m+n+e)), where k is the size of the smallest q-horn deletion backdoor set and e is the length of the input formula.