Fixed-Parameter Tractability

作者: Stefan Szeider , Marko Samer

DOI: 10.3233/978-1-58603-929-5-425

关键词: Computer scienceMathematical optimization

摘要:

参考文章(55)
Mihalis Yannakakis, Algorithms for acyclic database schemes very large data bases. pp. 82- 94 ,(1981)
Stefan S. Dantchev, Stefan Szeider, Barnaby Martin, Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution Electronic Colloquium on Computational Complexity. ,vol. 14, ,(2007)
Bistra Dilkina, Carla P. Gomes, Ashish Sabharwal, Tradeoffs in the complexity of backdoor detection principles and practice of constraint programming. pp. 256- 270 ,(2007) , 10.1007/978-3-540-74970-7_20
Sang-il Oum, Approximating rank-width and clique-width quickly workshop on graph theoretic concepts in computer science. pp. 49- 58 ,(2005) , 10.1007/11604686_5
Bruno Courcelle, The Monadic Second-Order Logic of Graphs: Definable Sets of Finite Graphs workshop on graph theoretic concepts in computer science. pp. 30- 53 ,(1988) , 10.1007/3-540-50728-0_34
Stefan Szeider, On Fixed-Parameter Tractable Parameterizations of SAT theory and applications of satisfiability testing. pp. 188- 202 ,(2003) , 10.1007/978-3-540-24605-3_15
Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In Automata, Languages and Programming. pp. 568- 580 ,(2004) , 10.1007/978-3-540-27836-8_49