Skip to main content
SpringerLink
Log in

The bounded tree-width problem of context-free graph languages

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

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

Included in the following conference series:

  • 120 Accesses

Abstract

We show that the following (equivalent) problems are P-complete:

  1. 1.

    Does a given confluent NCE graph grammar only generate graphs of bounded tree-width? and

  2. 2.

    is the graph language generated by a given confluent NCE graph grammar an HR language?

This settles the complexity of these important problems on graph grammars.

The work of the author was supported by the Deutsche Forschungsgemeinschaft (DFG) grant Br-835-7-1

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, J. Lagergren, D. Seese. Easy problems for tree-decomposable graphs. J. of Algorithms, 12:308–340, 1991.

    Google Scholar 

  2. S. Arnborg, A. Proskurowski. Linear time algorithms on graphs with bounded tree-width. LNCS, 317:105–119, 1989.

    Google Scholar 

  3. F.J. Brandenburg. On partially ordered graph grammars. LNCS, 291: 99–111, 1987.

    Google Scholar 

  4. F.J. Brandenburg. The equivalence of boundary and confluent graph grammars on graph languages of bounded degree. LNCS, 488:312–322, 1991.

    Google Scholar 

  5. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In SIAM J. Computing, 25:1305–1317, 1996.

    Google Scholar 

  6. B. Courcelle An axiomatic definition of context-free rewriting and its application to NLC graph grammars. Theoret. Compact. Sci., 55:141–181, 1987.

    Google Scholar 

  7. B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Inform. and Comput., 85:12–75, 1990.

    Google Scholar 

  8. B. Courcelle Structural properties of context-free sets of graphs generated by vertex replacement. Inform. and Comput., 116:275–293, 1995.

    Google Scholar 

  9. B. Courcelle, J. Engelfriet, and G. Rozenberg. Handle-rewriting hypergraph grammars. J. Comput. System Sci., 46:218–270, 1993.

    Google Scholar 

  10. J. Engelfriet. Context-free NCE graph grammars. LNCS, 380:148–161, 1989.

    Google Scholar 

  11. J. Engelfriet and L. M. Heyker. The string generating power of context-free hypergraph graph grammars. J. Comput. System Sci., 43:328–360, 1991.

    Google Scholar 

  12. J. Engelfriet and L. M. Heyker. Hypergraph languages of bounded degree. J. Comput. System Sci., 48:58–89, 1994.

    Google Scholar 

  13. J. Engelfriet and G. Leih. Linear graph grammars: Power and complexity. Inform. and Comput., 81:88–121, 1989.

    Google Scholar 

  14. J. Engelfriet, G. Leih, and E. Welzl. Boundary graph grammars with dynamic edge relabeling. J. Comput. System Sci., 40:307–345, 1990.

    Google Scholar 

  15. J. Engelfriet, G. Rozenberg. A comparison of boundary graph grammars and context-free hypergraph grammars. Inform. and Comput., 84:163–206, 1990.

    Google Scholar 

  16. H. Ehrig, H.J. Kreowski, and G. Rozenberg. Proceedings of Graph-Grammars and Their Application to Computer Science '90, Vol. 532 of LNCS. Springer-Verlag, 1991.

    Google Scholar 

  17. H. Ehrig, M. Nagl, A. Rosenfeld, and G. Rozenberg. Proceedings of Graph-Grammars and Their Application to Computer Science '86, Vol. 291 of LNCS. Springer-Verlag, 1987.

    Google Scholar 

  18. A. Habel. Hyperedge Replacement: Grammars and Languages, Vol. 643 of LNCS, Springer-Verlag, 1992.

    Google Scholar 

  19. D. Janssens and G. Rozenberg. On the structure of node label controlled graph languages. Inform. Sci., 20:191–216, 1980.

    Google Scholar 

  20. D. Janssens and G. Rozenberg. Restrictions, extensions, and variations of NLC grammars. Inform. Sci., 20:217–244, 1980.

    Google Scholar 

  21. M. Kaul. Syntaxanalyse von Graphen bei Präzedenz-Graphgrammatiken. Dissertation, Universität Osnabrück, Osnabrück, Germany, 1985.

    Google Scholar 

  22. T. Kloks. Treewidth. Computations and Approximations. Vol. 842 of LNCS, Springer-Verlag, 1994.

    Google Scholar 

  23. M. Nagl. Formal languages of labelled graphs. Computing 16:113–137, 1976.

    Google Scholar 

  24. M. Nagl. A tutorial and bibliographical survey of graph grammars. LNCS, 73:70–126, 1980.

    Google Scholar 

  25. K. Skodinis and E. Wanke. Emptiness problems of eNCE graph languages. J. Comput. System Sci., 51:472–485, 1995.

    Google Scholar 

  26. K. Skodinis and E. Wanke. The Bounded Degree Problem for eNCE Graph Grammars. Inform. and Comput., 135:15–35, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Passau, 94030, Passau, Germany

    R. Skodinis

Authors
  1. R. Skodinis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rolf H. Möhring

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Skodinis, R. (1997). The bounded tree-width problem of context-free graph languages. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1997. Lecture Notes in Computer Science, vol 1335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024506

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63757-8

  • Online ISBN: 978-3-540-69643-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation