Tree-width and the monadic quantifier hierarchy

Theoretical Computer Science

Volumn 303, Issue 1, 2003, Pages 157-170

  Makowsky, J A ^a   Marino J P ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSIDAD DE LOS ANDES   (Colombia)

Author keywords

Monadic second order logic; Parametrized complexity; Polynomial hierarchy; Tree width

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; TREES (MATHEMATICS);

MONADIC QUANTIFIER HIERARCHY;

COMPUTER SCIENCE;

EID: 0038040535     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00449-8     Document Type: Conference Paper

References (36)

1. Arnborg S., Lagergren J., Seese D. Easy problems for tree decomposable graphs. J. Algorithms. 12:1991;308-340.
2. Babai L., Turán G. The complexity of defining a relation on a finite graph. Z Math. Logik Grundlag. Math. 33:1987;277-288.
3. Bodlaender H.L. Dynamic programming algorithms on graphs with bounded tree-width. Proc. 15th Internat. Colloq. on Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 317:1988;105-119 Springer, Berlin.
4. Borie R.B., Parker R.G., Tovey C.A. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica. 7:1992;555-581.
5. Corneil D.G., Habib M., Lanlignel J.-M., Reed B., Rotics U. Polynomial time recognition of clique-width. ≤3 graphs Proc. LATIN'2000. Lecture Notes in Computer Science. Vol. 1776:2000;126-134 Springer, Berlin.
6. Courcelle B. The monadic second-order logic of graphs I. recognizable sets of finite graphs Inform. Comput. 85:1990;12-75.
7. Courcelle B. The expression of graph properties and graph transformations in monadic second-order logic. Rozenberg G. Handbook of Graph Grammars and Computing by Graph Transformations. Vol. 1:1997;313-400 Foundations, World Scientific, Singapore. (Chapter 5).
8. Courcelle B., Engelfriet J. A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars. Math. Systems Theory. 28:1995;515-552.
9. Courcelle B., Engelfriet J., Rozenberg G. Handle-rewriting hypergraph grammars. J. Comput. System Sci. 46:1993;218-270.
10. Courcelle B., Makowsky J.A., Rotics U. Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Systems. 33.2:2000;125-150.
11. Courcelle B., Makowsky J.A., Rotics U. On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic. Discrete Appl. Math. 108(1-2):2001;23-52.
12. Courcelle B., Mosbah M. Monadic second-order evaluations on tree-decomposable graphs. Theoret. Comput. Sci. 109:1993;49-82.
13. Courcelle B., Olariu S. Upper bounds to the clique-width of graphs. Discrete Appl. Math. 101:2000;77-114.
14. de Rougemont M. Second-order and inductive definability on finite structures. Z. Math. Logik Grundlag. Math. 33:1987;47-63.
15. Diestel R. Graph Theory. 1996;Graduate Texts in Mathematics, Springer, Berlin.
16. Doner J. Tree acceptors and some of their applications. J. Comput. Systems Sci. 4:1970;406-451.
17. Fagin R. Monadic generalized spectra. Z. Math. Logik Grundlag. Math. 21:1975;89-96.
18. Fagin R., Stockmeyer L., Vardi M. On monadic NP vs. monadic co-NP. Proc. 24nd ACM Symposium on Theory of Computing STOC'93. 1993;9-30 ACM, New York.
19. Garey M.G., Johnson D.S. Computers and Intractability. 1979;Mathematical Series, Freeman, New York.
20. Goldschlager L.M. The monotone and planar circuit value problems are log space complete for P. SIGACT News. 9.2:1977;25-29.
21. Golumbic M.C., Rotics U. On the clique-width of some perfect graph classes. Internat. J. Found. Comput. Sci. 11:2000;423-443.
22. Grädel T., Hirsch C., Otto M. Back and forth between guarded and modal logics. LiCS'2000. 2000;217-228 IEEE Press, New York.
23. M. Grohe, J. Mariño, Definability and descriptive complexity on databases of bounded tree-width, in: C. Beeri, P. Bunemann (Eds.), Database Theory-ICDT'99, Lecture Notes in Computer Science, Vol. 1540, Springer, Berlin, 1999, pp. 70-82. Springer, 1999.
24. Grohe M., Schwentick T., Segoufin L. When is the evaluation of conjunctive queries tractable? Proc. 32nd ACM Symposium on Theory of Computing, STOC'01. 2001;657-666 ACM, New York.
25. n,n, Lecture Notes in Comput. Sci., 1928, 2000, 196-205.
26. Habel A. Hyperedge replacement: grammars and languages. Lecture Notes in Computer Science. Vol. 643:1992;Springer, Berlin.
27. J.A. Makowsky, Logical methods in graph algorithms, Lecture Notes of a course given at ESSLLI'99 in Utrecht, August, 1999.
28. Makowsky J.A., Pnueli Y. Arity vs. alternation in second order logic. Ann. Pure Appl. Logic. 78(2):1996;189-202.
29. 4 's Internat. J. Found. Comput. Sci. 10:1999;329-348.
30. U. Rotics, Efficient algorithms for generally intractable graph problems restricted to specific classes of graphs, Ph.D. Thesis, Technion-Israel Institute of Technology, 1998.
31. Schweikardt N. The monadic quantifier alternation hierarchy over grids and pictures. CSL'97. Lecture Notes in Computer Science. Vol. 1414:1988;441-460 Springer, Berlin.
32. Seese D. The structure of the models of decidable monadic theories of graphs. Ann. Pure Appl. Logic. 53:1991;169-195.
33. Slisenko A.O. Computational complexity of string and graph identification. Lecture Notes in Comput. Sci. 74:1979;182-190.
34. Slisenko A.O. Context-free grammars as a tool for describing polynomial time subclasses of hard problems. Inform. Process. Lett. 14:1982;52-56.
35. Stockmeyer L. The polynomial time hierarchy. Theoret. Comput. Sci. 3:1977;1-22.
36. Thatcher J.W., Wright J.B. Generalized finite automata theory with an application to a decision problem in second-order logic. Math. Systems Theory. 2:1968;57-81.