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
Dissertation
Exact Exponential-Time Algorithms for Domination Problems in Graphs
TL;DR: This PhD thesis studies exact exponential-time algorithms for domination problems in graphs, which are algorithms that use a number of operations that is exponential in a complexity parameter of the input in the worst case and return an optimal solution to the problem.
Journal ArticleDOI
From Causes for Database Queries to Repairs and Model-Based Diagnosis and Back
Leopoldo Bertossi,Babak Salimi +1 more
TL;DR: In this paper, the authors establish and investigate connections between causes for query answers in databases, database repairs with respect to denial constraints, and consistency-based diagnosis, and show how to obtain database repairs from causes, and the other way around.
Book
Cognition and Intractability : A Guide to Classical and Parameterized Complexity Analysis
TL;DR: Cognition and Intractability is the first book to provide an accessible introduction to computational complexity analysis and its application to questions of intractability in cognitive science.
Journal ArticleDOI
Algorithm Engineering for Optimal Graph Bipartization
TL;DR: In this paper, the worst-case time complexity was improved from O(3k · kmn) to O( 3k · mn, where m is the number of vertices, k is the maximum number of edges to delete, and n is the minimum number of nodes to delete.
Proceedings Article
A multivariate complexity analysis of lobbying in multiple referenda
TL;DR: In this multivariate complexity analysis, a more holistic view on the nature of the computational complexity of LOBBYING is presented, providing both (parameterized) tractability and intractability results, depending on various problem parameterizations to be adopted.