The parameterized complexity of maximality and minimality problems

Annals of Pure and Applied Logic

Volumn 151, Issue 1, 2008, Pages 22-61

  Chen, Yijia ^a   Flum, Jörg ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Fagin definability; Maximality problems; Minimality problems; Parameterized complexity

Indexed keywords

EID: 37249049884     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2007.09.003     Document Type: Article

References (26)

1. Arvind V., and Raman V. Approximation algorithms for some parameterized counting problems. In: Bose P., and Morin P. (Eds). Algorithms and Computation, 13th International Symposium. ISAAC 2002. Lecture Notes in Computer Science vol. 2518 (2002), Springer 453-464
2. Buss J.F., and Islam T. Algorithms in the W-Hierarchy. Theory of Computing Systems (2007). http://www.springerlink.com/content/km17150236r167nu 10.1007/s00224-007-9040-7 Available at:
3. Byskov J.M. Enumerating maximal independent sets with applications to graph colouring. Operations Research Letters 32 6 (2004) 547-556
4. Chen Y., and Flum J. The parameterized complexity of maximality and minimality problems. Proceedings of the 2nd International Workshop on Parameterized and Exact Computation. Lecture Notes in Computer Science vol. 4169 (2006), Springer-Verlag 25-37
5. Chen Y., Flum J., and Grohe M. Machine-based methods in parameterized complexity theory. Theoretical Computer Science 339 2-3 (2005) 167-199
6. Downey R.G., and Fellows M.R. Fixed-parameter tractability and completeness. Congressus Numerantium 87 (1992) 161-178
7. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer-Verlag
8. Downey R.G., Fellows M.R., and Regan K. Descriptive complexity and the W-hierarchy. Proof Complexity and Feasible Arithmetic. AMS-DIMACS Volume 39 Series (1998) 119-134
9. Eiter T., and Gottlob G. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing 24 6 (1995) 1278-1304
10. Eppstein D. Small maximal independent sets and faster exact graph coloring. Journal of Graph Algorithms Applications 7 2 (2003) 131-140
11. D. Eppstein, All maximal independent sets and dynamic dominance for sparse graphs, in: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms Complexity, SODA'05, 2003, pp. 451-459
12. Fernau H. Parameterized Algorithms: A Graph-Theoretic Approach (2005), Habilitationsschrift, Universität Tübingen, Tübingen, Germany
13. Flum J., and Grohe M. Fixed-parameter tractability, definability, and model checking. SIAM Journal on Computing 31 1 (2001) 113-145
14. Flum J., and Grohe M. Describing parameterized complexity classes. Information and Computation 187 (2003) 291-319
15. Flum J., and Grohe M. The parameterized complexity of counting problems. SIAM Journal on Computing 33 4 (2005) 892-922
16. Flum J., and Grohe M. Model-checking problems as a basis for parameterized intractability. Logical Methods in Computer Science 1 1 (2004)
17. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer-Verlag
18. 2 n nondeterministic bits. Journal of Computer and System Sciences 72 (2006) 34-71
19. Fomin F.V., Grandoni F., Pyatkin A.V., and Stepanov A.A. Bounding the number of minimal dominating sets: A measure and conquer approach. Proceedings of the 16th International Symposium on Algorithms and Computation. ISAAC'05. Lecture Notes in Computer Science vol. 3827 (2005), Springer-Verlag
20. M. Grohe, Private communication, 2006
21. M. Grohe, The complexity of generalized model-checking problems. Unpublished manuscript
22. R. Impagliazzo, A. Wigderson, P = BPP unless E has subexponential circuits: Derandomizing the XOR lemma, in: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, STOC'97, 1997, pp. 220-229
23. Khot S., and Raman V. Parameterized complexity of finding subgraphs with hereditary properties. Theoretical Computer Science 289 2 (2002) 997-1008
24. Lawler E.L. A note on the complexity of the chromatic number problem. Information Processing Letter 5 3 (1976) 66-67
25. M. Müller, Parameterized versions of a theorem of Valiant and Vazirani (in preparation)
26. M. Thurley, Tractability and intractability of parameterized counting problems, Diplomarbeit, Humboldt-Universität zu Berlin, 2006