Skip to main content
SpringerLink
Log in

Metatheorems for decision problems on hyperedge replacement graph languages

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

If a graph-theoretical property is compatible with the derivation process of hyperedge replacement graph grammars in a certain way, the property turns out to be decidable for the corresponding graph languages. More exactly speaking, we consider two questions:

  1. (1)

    Is there a graph in the generated language having the property?

  2. (2)

    Do all graphs in the generated language have the property?

In both cases, we get decidability for all hyperedge replacement graph grammars as inputs. Colorability, Hamiltonicity, and planarity are shown to be compatible so that our decidability results apply to them.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Claus, V., Ehrig, H., Rozenberg, G. (eds.): Graph Grammars and Their Application to Computer Science and Biology. Lect. Notes Comput. Sci. 73 (1979)

  2. Courcelle, B.: On Context-Free Sets of Graphs and Their Monadic Second-Order Theory. Lect. Notes Comput. Sci. 291, 133–146 (1987)

    Google Scholar 

  3. Ehrig, H., Nagl, M., Rozenberg, G. (eds.): Graph Grammars and Their Application to Computer Science, (2nd Int. Workshop). Lect. Notes Comput. Sci. 153 (1983)

  4. Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds.): Graph Grammars and Their Application to Computer Science, (3rd Int. Workshop). Lect. Notes Comput. Sci. 291 (1987)

  5. Habel, A.: Graph-Theoretic Properties Compatible with Graph Derivations. Proc. Graph-Theoretic Concepts in Computer Science, Lect. Notes Comput. Sci. 344, 11–29 (1989)

    Google Scholar 

  6. Habel, A., Kreowski, H.-J.: On Context-Free Graph Languages Generated by Edge Replacement. Lect. Notes Comput. Sci. 153, 143–158 (1983)

    Google Scholar 

  7. Habel, A., Kreowski, H.-J.: Characteristics of Graph Languages Generated by Edge Replacement, Theoret. Comp. Sci. 51, 81–115 (1987)

    Google Scholar 

  8. Habel, A., Kreowski, H.-J.: May We Introduce to You: Hyperedge Replacement. Lect. Notes Comput. Sci 291, 15–26 (1987)

    Google Scholar 

  9. Habel, A., Kreowski, H.-J.: Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement. Lect. Notes Comput. Sci. 247, 207–219 (1987)

    Google Scholar 

  10. Habel, A., Kreowski, H.-J., Vogler, W.: Compatible Graph Properties are Decidable for Hyperedge Replacement Graph Languages. EATCS Bull. 33, 55–62 (1987)

    Google Scholar 

  11. Habel, A., Kreowski, H.J., Vogler, W.: Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammars. Proc. TAPSOFT '89. Lect. Notes Comput. Sci. 351, 275–289 (1989)

    Google Scholar 

  12. Janssens, D., Rozenberg, G., Welzl, E.: The Bounded Degree Problem for NLC Grammars is Decidable. J. Comput. Syst. Sci. 33, 415–422 (1986)

    Google Scholar 

  13. Kreowski, H.-J.: Rule Trees Can Help to Escape Hard Graph Problems. (unpublished manuscript)

  14. Lautemann, C.: Decomposition Trees: Structured Graph Representation and Efficient Algorithms. Proc. CAAP '88. Lect. Notes Comput. Sci. 299, 28–39 (1988)

    Google Scholar 

  15. Lengauer, T.: Efficient Solution of Biconnectivity Problems on Hierarchically Defined Graphs. Proc. of the WG '85, Linz: Trauner, 201–215 (1985)

  16. Lengauer, T., Wanke, E.: Efficient Analysis of Graph Properties on Context-Free Graph Languages. Proc. ICALP '88. Lect. Notes Comput. Sci. 317, 379–393 (1988)

    Google Scholar 

  17. Rozenberg, G., Welzl, E.: Boundary NLC Graph Grammars — Basic Definitions, Normal Forms and Complexity. Inf. Control 69, 136–167 (1986)

    Google Scholar 

  18. Rozenberg, G., Welzl, E.: Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages. Acta Inf. 23, 289–309 (1986)

    Google Scholar 

  19. Slisenko, A.O.: Context-Free Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems. Inf. Proc. Lett. 14, 52–56 (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik und Informatik, Universität Bremen, Postfach 330440, D-2800, Bremen 33, Federal Republic of Germany

    Annegret Habel & Hans -Jörg Kreowski

  2. Institut für Informatik, Technische Universität München, Postfach 202420, D-8000, München 2, Federal Republik of Germany

    Walter Vogler

Authors
  1. Annegret Habel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans -Jörg Kreowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Walter Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Habel, A., Kreowski, H.J. & Vogler, W. Metatheorems for decision problems on hyperedge replacement graph languages. Acta Informatica 26, 657–677 (1989). https://doi.org/10.1007/BF00288976

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation