Skip to main content
SpringerLink
Log in

Tree-partite graphs and the complexity of algorithms

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 199))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Barwise (ed.), Handbook of Mathematical Logic, North-Holland, Amsterdam 1977.

    Google Scholar 

  2. B. Bollobás, Extremal Graph Theory, Academic Press, London 1978.

    Google Scholar 

  3. H.D. Ebbinghaus, J. Flum, W. Thomas, Mathematical Logic, Undergraduate Texts in Mathematics, Springer-Verlag, New-York, 1984.

    Google Scholar 

  4. P. van Emde Boas, Dominoes are Forever, preprint 1983.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  7. N. Immerman, Languages Which Capture Complexity Classes, acm-proceedings of the 15 annual acm symp. on the theory of computing, 1983, pp. 347–354.

    Google Scholar 

  8. M.O. Rabin, Decidability of second order theories and automata on infinite trees, Trans. Am. Math. Soc. 141, 1969, 1–35.

    Google Scholar 

  9. N. Robertson and P.D. Seymour, Graph minors I. Excluding a forest, J. Combin. Theory Ser. B 35, 1983, 39–61.

    Google Scholar 

  10. N. Robertson and P.D. Seymour, Graph Minors III. Planar Tree-Width, J. Combin. Theory Ser. B 36, 1984, 49–64.

    Google Scholar 

  11. P. Scheffler, personal communication.

    Google Scholar 

  12. D.G. Seese, Entscheidbarkeits-und Interpretierbarkeitsfragen monadischer Theorien zweiter Stufe gewisser Klassen von Graphen, Dissertation, Humboldt-Universität zu Berlin, 1976.

    Google Scholar 

  13. D.G. Seese, Ein Unentscheidbarkeitskriterium, Wiss. Z. der Humboldt-Univ. zu Berlin Math.-Nat. R. XXIV, 1975,6, 772–780.

    Google Scholar 

  14. D.G. Seese, Some Graph Theoretical Operations and Decidability, Math. Nachr. 87, 1979, 15–21.

    Google Scholar 

  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.

    Google Scholar 

  16. C. Thomassen, Infinite Graphs, in Selected Topics in Graph Theory 2, L.W. Beineke and R.J. Wilson (ed.), Acad. press, 1983, London, 129–160.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IMath, AdW der DDR, Mohrenstr. 39, Pf. 1304, DDR - 1086, Berlin

    D. Seese

Authors
  1. D. Seese
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seese, D. (1985). Tree-partite graphs and the complexity of algorithms. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028825

Download citation

  • DOI: https://doi.org/10.1007/BFb0028825

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

  • Online ISBN: 978-3-540-39636-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation