Tree-partite graphs and the complexity of algorithms

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

Volumn 199 LNCS, Issue , 1985, Pages 412-421

  Seese, D ^a  

^a Institut für Mathematik   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85034428662     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028825     Document Type: Conference Paper

References (16)

1. J. Barwise (ed.), Handbook of Mathematical Logic, North-Holland, Amsterdam,1977.
2. B. Bollobäs, Extremal Graph Theory, Academic Press, London 1978.
3. H.D. Ebbinghaus, J. Flum, W. Thomas, Mathematical Logic, Undergraduate Texts in Mathematics, Springer-Verlag, New-York, 1984.
4. P. van Emde Boas, Dominoes are Forever, preprint 1983.
5. R. Fagin, Generalized First-Order Spectra and Polynomial-Time Recognizable Sets, in Complexity of Computation, (ed. R. Karp), SIAM -AMS Proc. 7, 1974, pp 27-41.
6. M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Francisco 1978.
7. N. Imroerman, Languages Which Capture Complexity Classes, acra-proceedings of the 15 annual acm symp. on the theory of computing 1983, pp. 347-354.
8. M.O. Rabin, Decidability of second order theories and automata on infinite trees, Trans. Am. Math. Soc. 141, 1969, 1-35.
9. N. Robertson and P.D. Seymour, Graph minors I. Excluding a forest J. Corabin. Theory Ser. B 35, 1983, 39-61.
10. N. Robertson and P.D. Seymour, Graph Minors III. Planar Tree-Width, J. Combin. Theory Ser. B 36, 1984, 49-64.
11. P. Scheffler, personal communication.
12. D.G. Seese, Entscheidbarkeits-und Interpretierbarkeitsfragen monadischer Theorien zweiter Stufe gewisser Klassen von Graphen, Dissertation, Humboldt-Universität zu Berlin, 1976.
13. D.G. Seese, Ein Unentscheidbarkeitskriterium, Wiss. Z. der Hum-boldt-Univ. zu Berlin Math.-Nat. R. XXIV, 1975,6, 772-780.
14. D.G. Seese, Some Graph Theoretical Operations and Decidability. Math. Nachr. 87, 1979, 15-21.
15. K. Takamizawa, T. Nishizeki, N. Saito, Linear-Time Computability of Combinatorial Problems on Series-Parallel Graphs, J. of the Association for Computing Machinery, Vol. 29, No. 3, 1982, 623-641.
16. C. Thomassen, Infinite Graphs, in Selected Topics in Graph Theory Beineke and R.J. Wilson (ed.), Acad, press, 1983, London, 129—150.