Skip to main content
SpringerLink
Log in

The complexity of connectivity problems on context-free graph languages

Extended abstract

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

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

Included in the following conference series:

Abstract

We analyze the precise complexity of connectivity problems on graph languages generated by context-free graph rewriting systems under various restrictions. Let L be the family of all context-free graph rewriting systems that generate at least one disconnected resp. connected graph. We show that L is DEXPTIME-complete w.r.t. log-space reductions. If L is finite then L is PSPACE-complete w.r.t. log-space reductions. These results hold true for graph rewriting systems as for example boundary node label controlled (BNLC) graph grammars, hyper-edge replacement systems (HRS's), apex (APEX) graph grammars, simple context-free node label controlled (SNLC) graph grammars, and even for the simple context-free graph grammars introduced by Slisenko in [Sli82].

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. B. Courcelle. An axiomatic definition of context-free rewriting and its application to NLC graph grammars. Theoretical Computer Science, 55:141–181, 1987.

    Article  Google Scholar 

  2. B. Courcelle. On context-free sets of graphs and their monadic second-order theory. In H. Ehrig, M. Nagl, A. Rosenfeld, and G. Rozenberg, editors, Proceedings of Graph-Grammars and Their Application to Computer Science '86, pages 133–146, LNCS No. 291, Springer Verlag, Berlin/New York, 1987.

    Google Scholar 

  3. J. Engelfriet, G Leih, and G Rozenberg. Apex graph grammars. In H. Ehrig, M. Nagl, A. Rosenfeld, and G. Rozenberg, editors, Proceedings of Graph-Grammars and Their Application to Computer Science '86, pages 167–185, LNCS No. 291, Springer Verlag, Berlin/New York, 1987.

    Google Scholar 

  4. A. Habel. Graph-theoretic properties compatible with graph derivations. In J. van Leeuwen, editor, Proceedings of Graph-Theoretic Concepts in Computer Science, WG '88, pages 11–29, LNCS No. 344, Springer Verlag, Berlin/New York, 1989.

    Google Scholar 

  5. A. Habel and H.J. Kreowski. May we introduce to you: hyperedge replacement. In H. Ehrig, M. Nagl, A. Rosenfeld, and G. Rozenberg, editors, Proceedings of Graph-Grammars and Their Application to Computer Science '86, pages 15–26, LNCS No. 291, Springer Verlag, Berlin/New York, 1987.

    Google Scholar 

  6. A. Habel, H.J. Kreowski, and W. Vogler. Compatible graph properties are decidable for hyperedge replacement graph languages. In Bulletin of the European Association for Theoretical Computer Science No. 33, pages 55–62, EATCS, October 1987. To appear in Acta Informatica.

    Google Scholar 

  7. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Massachusetts, 1979.

    Google Scholar 

  8. T. Lengauer and E. Wanke. Efficient analysis of graph properties on context-free graph languages. In T. Lepistö and A. Salomaa, editors, Proceedings of ICALP '88, pages 379–393, LNCS No. 317, Springer Verlag, Berlin/New York, 1988.

    Google Scholar 

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

    Article  Google Scholar 

  10. G. Rozenberg and E. Welzl. Boundary NLC graph grammars — basic definitions, normal forms, and complexity. Information and Control, 69(1–3):136–167, April/May/June 1986.

    Article  Google Scholar 

  11. G. Rozenberg and E. Welzl. Graph theoretic closure properties of the family of boundary NLC graph languages. Acta Informatica, 23:289–309, 1986.

    Article  Google Scholar 

  12. G. Rozenberg and E. Welzl. Combinatorial properties of boundary NLC graph languages. Discrete Applied Mathematics, 16:59–73, 1987.

    Article  Google Scholar 

  13. A.O. Slisenko. Context-free grammars as a tool for describing polynomial-time subclasses of hard problems. Information Processing Letters, 14(2):52–56, 1982.

    Article  Google Scholar 

  14. E. Wanke. Algorithms for graph problems on BNLC structured graphs. Technical Report 58, Universität-Gesamthochschule Paderborn, West-Germany, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematik/Informatik, Universität-Gesamthochschule Paderborn, Fachbereich 17, 4790, Paderborn, West Germany

    Egon Wanke

Authors
  1. Egon Wanke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Csirik J. Demetrovics F. Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wanke, E. (1989). The complexity of connectivity problems on context-free graph languages. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-51498-8_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48180-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation