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
Directeur de thèse
François Buton,Vincent Dubois +1 more
TL;DR: In this paper, high-resolution X-ray absorption near edge structure (XANES) spectroscopy was used to measure Al L2,3-edges from selected materials containing aluminum in different site geometries.
Journal ArticleDOI
Comparison and enumeration of chemical graphs
Tatsuya Akutsu,Hiroshi Nagamochi +1 more
TL;DR: This review article overviews several graph classes relevant to chemical compounds and the computational complexities of several fundamental problems for these graph classes and discusses the relationship between the fifth problem and kernel functions for chemical compounds.
Proceedings ArticleDOI
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
TL;DR: It follows from the result that Directed Multicut is FPT for the case of k = 2 terminal pairs, which answers another open problem raised in Marx and Razgon (STOC 2011).
Proceedings ArticleDOI
Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity
TL;DR: In this article, the authors propose to extend information extraction languages with the ability to use mappings, thus allowing them to work with documents which have missing or optional parts, and simplify the semantics of regex formulas and extraction rules, two previously defined methods for extracting information.
Journal ArticleDOI
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG
Venkatesh Raman,Saket Saurabh +1 more
TL;DR: Improved parameterized algorithms for two ''edge'' problems MAXCUT and MAXDAG, where the solution sought is a subset of edges, are given and it is shown that if a directed graph has minimum out degree at least f(n) (some function of n) then Directed Feedback Arc Set problem is fixed parameter tractable.