Monadic NP and graph minors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1584, Issue , 1999, Pages 126-141

  Kreidler, Martin ^a   Seese, Detlef ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Descriptive complexity theory; Ehrenfeucht fra ss games; Finite model theory; Monadic second order logic

Indexed keywords

ARBITRARY DEGREE; BINARY RELATION; COMPLETE GRAPHS; DESCRIPTIVE COMPLEXITY THEORY; FINITE MODEL THEORY; GRAPH CONNECTIVITY; MONADIC SECOND-ORDER LOGIC; WINNING STRATEGY;

COMPUTER CIRCUITS;

EID: 3142771638     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10703163_9     Document Type: Conference Paper

References (21)

1. M. Ajtai and R. Fagin: Reachability is harder for directed than for undirected finite graphs, in Journal of Symbolic Logic, 55 (1), pp. 113-150, 1990. 128
2. S. Arnborg, J. Lagergren and D. Seese: Easy Problems for Tree-Decomposable Graphs, Journal of Algorithms vol. 12, pp. 308-340, 1991.
3. C. Chang and H. Keisler: Model Theory North-Holland, 1974, 3rd edition, 1990.
4. R. Diestel: Graph Theory, Springer-Verlag, 1997. 127, 140
5. H.-D. Ebbinghaus and J. Flum: Finite Model Theory, Springer-Verlag, 1995. 127
6. R. Fagin: Generalized First-Order spectra and polynomial-time recognizable sets, in Complexity of Computation, (ed. R. Karp) SIAM-AMS Proc. 7, pp. 27-41, 1974. 126, 126
7. R. Fagin: Monadic generalized spectra, in Zeitschrift fur mathematische Logik und Grundlagen der Mathematik vol. 21, pp. 89-96, 1975. 127
8. R. Fagin: Comparing the Power of Games on Graphs, in Mathematical Logic Quarterly vol. 43, pp. 431-455, 1997.
9. R. Fagin, L. Stockmeyer and M. Vardi: On Monadic NP vs. Monadic co-NP, in Information and Computation vol. 120 (1), pp. 78-92, 1995. 127, 127, 140
10. W. Hodges: Model Theory, Cambridge University Press, 1993.
11. N. Immerman: Languages That Capture Complexity Classes, in SIAM Journal of Computing vol. 16 (4), pp. 760-778, 1987. 126
12. M. Kreidler and D. Seese: Monadic NP and Built-in Trees, in Proc. CSL'96, LNCS 1258, Springer-Verlag, pp. 260-274, 1997. 127, 129
13. C. H. Papadimitriou: Computational Complexity, Addison-Wesley Publishing Company, Reading, Massachusetts, 1994. 127
14. N. Robertson and P. Seymour: Graph minors - a survey, in I. Anderson (Ed.), Surveys in Combinatorics, Cambridge University Press, pp. 153-171, 1985.
15. N. Robertson and P. D. Seymour: Graph Minors IV: Tree-Width and Well-Quasi- Ordering, Journal of Comb. Theory Series B, vol. 48, pp. 227-254, 1990. 127
16. N. Robertson and P. Seymour: Graph minors XII: Excluding a non-planar graph, in Journal of Combinatorial Theory Series B vol. 64, pp. 240-272, 1995. 127, 140
17. N. Robertson and P. Seymour: Graph minors XIII: The disjoint path 'problem, in Journal of Combinatorial Theory Series B vol. 63, 1995, pp. 65-110, 1995. 127, 127, 140
18. T. Schwentick: On Winning Strategies in Ehrenfeucht Games and Monadic NP, in Annals of Pure and Applied Logic vol. 79, pp. 61-92, 1996. 127, 129, 136, 136
19. D. Seese and W. Wessel: Graphminoren und Gitter: Zu einigen Arbeiten von N. Robertson und P. Seymour, in Graphentheorie III (edts. K. Wagner and R. Bodendiek), BI Wissenschaftsverlag, 1993.
20. S. Shelah: Classification Theory and the Number of Non-Isomorphic Models, Studies in Logic series, North-Holland, 1978. 130, 130
21. K. Wagner: Uber eine Eigenschaft der ebenen Komplexe, in Mathematische Annalen vol. 114, pp. 570-590, 1937.