Skip to main content
SpringerLink
Log in

Bounded tree-width and LOGCFL

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1993)

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

Included in the following conference series:

Abstract

We show that (1) the recognition of tree-width bounded graphs and (2) the decidability of graph properties—which are defined by finite equivalence relations on h-sourced graphs—on tree-width bounded graphs belong to the complexity class LOGCFL. This is the lowest complexity class known for these problems. Our result complements the research in a series of papers [1, 2, 3, 5, 8, 9, 12, 15, 16] by Arnborg, Bodlaender, Chandrasekharan, Courcelle, Hedetniemi, Lagergren, Proskurowski, Reed, Robertson, Seymour, Seese, and many others.

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. S. Arnborg, D.G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM Journal of Algebraic and Discrete Methods, 8(2):227–284, April 1987.

    Google Scholar 

  2. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. In H. Ehrig, H.J. Kreowski, and G. Rozenberg, editors, Graph-Grammars and Their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, pages 70–83. Springer-Verlag, Berlin/New York, 1991. To appear in Journal of the ACM.

    Google Scholar 

  3. S. Arnborg, J. Lagergren, and D. Seese. Problems easy for tree-decomposable graphs. Journal of Algorithms, 12:308–340, 1991.

    Google Scholar 

  4. H.L. Bodlaender. NC-algorithms for graphs with bounded tree-width. In J. van Leeuwen, editor, Proceedings of Graph-Theoretical Concepts in Computer Science, volume 344 of Lecture Notes in Computer Science, pages 1–10. Springer-Verlag, Berlin/New York, 1988.

    Google Scholar 

  5. H.L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In Annual ACM Symposium on Theory of Computing, 1993.

    Google Scholar 

  6. A. Borodin, S.A. Cook, P.W. Dymond, W.L. Ruzzo, and M.L. Tompa. Two applications of inductive counting for complementation problems. SIAM Journal of Computing, 18:559–578, 1989.

    Google Scholar 

  7. A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer. Alternation. Journal of the ACM, 28:114–133, 1981.

    Google Scholar 

  8. N. Chandrasekharan and A. Hedetniemi. Fast parallel algorithms for tree decomposition and parsing partial k-trees. In 26th Annual Allerton Conference on Communication, Control, and Computing, 1988.

    Google Scholar 

  9. B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12–75, 1990.

    Google Scholar 

  10. M.R. Garey and D.S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco, 1979.

    Google Scholar 

  11. N. Immerman. Languages that capture complexity classes. SIAM Journal of Computing, 16(4):760–778, August 1987.

    Google Scholar 

  12. J. Lagergren. Efficient parallel algorithms for tree-decomposition and related problems. In Annual ACM Symposium on Foundations of Computer Science, pages 218–223. IEEE, 1990.

    Google Scholar 

  13. T. Lengauer and E. Wanke. Efficient solution of connectivity problems on hierarchically defined graphs. SIAM Journal of Computing, 17(6):1063–1080, December 1988.

    Google Scholar 

  14. T. Lengauer and E. Wanke. Efficient analysis of graph properties on context-free graph languages. Journal of the A CM, 40(2):368–393, 1993.

    Google Scholar 

  15. B. Reed. Finding approximate separators and computing tree width quickly. In Annual ACM Symposium on Theory of Computing, pages 221–228, 1992.

    Google Scholar 

  16. N. Robertson and P.D. Seymour. Graph minors II. Algorithmic aspects of tree width. Journal of Algorithms, 7:309–322, 1986.

    Google Scholar 

  17. W.L. Ruzzo. Tree-size bounded alternation. Journal of Computer and System Sciences, 21:218–235, 1980.

    Google Scholar 

  18. I.H. Sudborough. On the tape complexity of deterministic context-free languages. Journal of the ACM, 25:405–414, 1978.

    Google Scholar 

  19. E. Wanke. Algorithms for graph problems on BNLC structured graphs. Information and Computation, 94(1):93–122, September 1991.

    Google Scholar 

  20. E. Wanke. k-NLC graphs and polynomial algorithms. Special Issue in Annals of Discrete Mathematics, 1993. To appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. German National Research Center for Computer Science, GMD, D-53757, Sankt Augustin, Germany

    Egon Wanke

Authors
  1. Egon Wanke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wanke, E. (1994). Bounded tree-width and LOGCFL. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1993. Lecture Notes in Computer Science, vol 790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57899-4_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-57899-4_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57899-4

  • Online ISBN: 978-3-540-48385-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation