Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph Grammars and Their Application to Computer Science

Graph Grammars 1990: Graph Grammars and Their Application to Computer Science pp 1–11Cite as

A note on hyperedge replacement

  • Conference paper
  • First Online:

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

Abstract

In this note, we recall the basic features of hyperedge replacement as one of the most elementary and frequently used concepts of graph rewriting. Moreover, we discuss the Contextfreeness Lemma for derivations in hyperedge-replacement grammars.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Arnborg, J. Lagergren, D. Seese: Which problems are easy for tree-decomposable graphs? Lecture Notes in Computer Science 317, 38–51, 1988.

    Google Scholar 

  2. S. Arnborg: Efficient algorithms for combinatorial problems on graphs with bounded decomposability — a survey. BIT 25, 2–23, 1985.

    Article  Google Scholar 

  3. M. Bauderon, B. Courcelle: Graph expressions and graph rewriting. Mathematical Systems Theory 20, 83–127, 1987.

    Article  Google Scholar 

  4. H. L. Bodlaender: Classes of graphs with bounded tree-width. Report RUU-CS-86-22, Rijskuniversiteit Utrecht, vakgroep informatica, 1986.

    Google Scholar 

  5. H. L. Bodlaender: Dynamic programming on graphs with bonded tree-width. Lecture Notes in Computer Science 317, 105–118, 1988.

    Google Scholar 

  6. H. L. Bodlaender: NC-algorithms for graphs with small tree-width. Report RUU-CS-88-4, Rijskuniversiteit Utrecht, vakgroep informatica, 1988.

    Google Scholar 

  7. B. Courcelle: On context-free sets of graphs and their monadic second-order theory. Lecture Notes in Computer Science 291, 133–146, 1987.

    Google Scholar 

  8. B. Courcelle: A representation of graphs by algebraic expressions and its use for graph rewriting systems. Lecture Notes in Computer Science 291, 112–132, 1987.

    Google Scholar 

  9. B. Courcelle: The monadic second-order logic of graphs, III: tree-width, forbidden minors and complexity issues. Preprint, Université Bordeaux 1, 1988.

    Google Scholar 

  10. J. Feder: Plex languages. Information Science 3, 225–241, 1971.

    Article  Google Scholar 

  11. A. Habel: Hyperedge Replacement: Grammars and Languages. Dissertation, Univ. Bremen, 1989.

    Google Scholar 

  12. A. Habel, H.-J. Kreowski: Characteristics of graph languages generated by edge replacement. Theoretical Computer Science 51, 81–115, 1987.

    Article  Google Scholar 

  13. A. Habel, H.-J. Kreowski: May we introduce to you: hyperedge replacement. Lecture Notes in Computer Science 291, 15–26, 1987.

    Google Scholar 

  14. A. Habel, H.-J. Kreowski: Some structural aspects of hypergraph languages generated by hyperedge replacement. Lecture Notes in Computer Science 247, 207–219, 1987.

    Google Scholar 

  15. A. Habel, H.-J. Kreowski, W. Vogler: Decidable boundedness problems for hyperedge replacement graph grammars. Lecture Notes in Computer Science 351, 275–289, 1989. Proc. TAPSOFT 89.

    Google Scholar 

  16. A. Habel, H.-J. Kreowski, W. Vogler: Metatheorems for decision problems on hyperedge replacement graph languages. Acta Informatica 26, 657–677, 1989.

    Article  Google Scholar 

  17. H.-J. Kreowski: A pumping lemma for context-free graph languages. Lecture Notes in Computer Science 73, 270–283, 1979.

    Google Scholar 

  18. C. Lautemann: Decomposition trees: structured graph representation and efficient algorithms. Lecture Notes in Computer Science 299, 28–39, 1988. Proc. CAAP 88.

    Google Scholar 

  19. C. Lautemann: The complexity of graph languages generated by hyperedge replacement. Acta Informatica 27, 399–421, 1990.

    Article  Google Scholar 

  20. T. Lengauer, E. Wanke: Efficient analysis of graph properties on context-free graph languages. Lecture Notes in Computer Science 317, 379–393, 1988.

    Google Scholar 

  21. T. Pavlidis: Linear and context-free graph grammars. Journal of the ACM 19(1), 11–23, 1972.

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik und Informatik, Universität Bremen, Postfach 33 04 40, W-2800, Bremen

    Frank Drewes & Hans-Jörg Kreowski

Authors
  1. Frank Drewes
    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

Editor information

Hartmut Ehrig Hans-Jörg Kreowski Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Drewes, F., Kreowski, HJ. (1991). A note on hyperedge replacement. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017373

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38395-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation