Skip to main content
SpringerLink
Log in

Node rewriting in hypergraphs

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

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

Included in the following conference series:

Abstract

Pullback rewriting has recently been introduced as a new and unifying paradigm for vertex rewriting in graphs. In this paper we show how to extend it to describe in a uniform way more rewriting mechanisms such as node and handle rewriting in hypergraphs.

This work has been supported by the Esprit BRA ”Computing with graph transformations”

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. M. Bauderon, A categorical approach to vertex replacement: the generation of infinite graphs, 5th International Conference on Graph Grammars and their applications to Computer Science, Williamsburg, November 1994, Lect. Notes in Comp. Sci. N 1073, 1996, 27–37.

    Google Scholar 

  2. M. Bauderon, A uniform approach to graph rewriting: the pullback approach, in Proceedings WG'95, Lect. Notes in Comp. Sci n 1017.

    Google Scholar 

  3. M. Bauderon, Parallel rewriting through the pullback approach, in SEGRA-GRA'95, to appear, Elect. Notes in Theor. Comp. Sci.

    Google Scholar 

  4. M. Bauderon, B. Courcelle, Graph expressions and graph rewriting, Math. Systems Theory 20 (1987), 83–127

    Google Scholar 

  5. M. Bauderon, H. Jacquet, Node rewriting in hypergraphs (full version), Submitted.

    Google Scholar 

  6. A. Bottreau, Y. Métivier, Kronecker product and local computations in graphs, CAAP'96, Lect. Notes in Comp. Sci. N 105, 1996, 02–16.

    Google Scholar 

  7. B. Courcelle, An axiomatic definition of context-free rewriting and its applications to NLC graph grammars, Theor. Comput. Sci 55 (1987), 141–181.

    Google Scholar 

  8. B. Courcelle, Graph rewriting: an algebraic and logic approach, in J. Van Leeuwen, ed, Handbook of Theoretical Computer Science, Vol. B (Elsevier, Amsterdam, 1990) 193–242

    Google Scholar 

  9. B. Courcelle, J. Engelfriet, G. Rozenberg, Handle-Rewriting Hypergraph Grammars. Jour. Comp. Sys. Sci. 46, (1993), 218–270

    Google Scholar 

  10. J. Engelfriet, G. Rozenberg, A comparison of boundary graph grammars and context-free hypergraph grammars, Inf. Comp. 84, 1990, 163–206

    Google Scholar 

  11. J. Engelfriet, G. Rozenberg, Graph grammars based on node rewriting: an introduction to NLC grammars, Lect. Notes in Comp Sci N 532, 1991, 12–23.

    Google Scholar 

  12. J. Engelfriet, L. Heyker, G. Leih, Context free graph languages of bounded degree are generated by apex graph grammars, Acta Informatica 31, 341–378 (1994)

    Google Scholar 

  13. H. Ehrig, Introduction of the algebraic theory of graph grammars, in Graph Grammars and their applications to Computer Science, Lect. Notes in Comp Sci N 73, 1979, 1–69

    Google Scholar 

  14. M. Farzan, D.A. Waller, Kronecker products and local joins of graphs, Can. J. Math. Vol. XXIX, No 2 1977, 255–269

    Google Scholar 

  15. A. Habel, Hyperedge Replacement: Grammars and Languages, Lect. Notes in Comp Sci N 643, 1992.

    Google Scholar 

  16. D. Janssens, G. Rozenberg, On the structure of node-label-controlled graph languages, Inform. Sci. 20 (1980), 191–216.

    Google Scholar 

  17. D. Janssens, G. Rozenberg, Graph grammars with neighboorhood-controlled embedding, Theor. Comp. Sci. 21 (1982), 55–74.

    Google Scholar 

  18. C. Kim, T.E. Jeong, HRNCE Grammars, — A hypergraphs generating system with an eNCE way of rewriting, 5th International Conference on Graph Grammars and their applications to Computer Science, Williamsburg, November 1994, Lect. Notes in Comp. Sci. 1073, 383–396.

    Google Scholar 

  19. R. Klempien-Hinrichs, Node Replacement in Hypergraphs: Simulation of hyperedge replacement and decidability of confluence, 5th International Conference on Graph Grammars and their applications to Computer Science, Williamsburg, November 1994, Lect. Notes in Comp. Sci. 1073, 397–411.

    Google Scholar 

  20. S. McLane, Categories for the working mathematician, Springer, Berlin, 1971.

    Google Scholar 

  21. E. Sopena, The chromatic number of oriented graphs, Research Report 1083-95, LaBRI, Bordeaux

    Google Scholar 

  22. W. Vogler, On hyperedge replacement and BNLC graph grammars, Discrete Applied Mathematics 46 (1993) 253–273.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire Bordelais de Recherche en Informatique, Université Bordeaux I, 33405, Talence Cedex

    Michel Bauderon & Hélène Jacquet

Authors
  1. Michel Bauderon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hélène Jacquet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Fabrizio d'Amore Paolo Giulio Franciosa Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bauderon, M., Jacquet, H. (1997). Node rewriting in hypergraphs. In: d'Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds) Graph-Theoretic Concepts in Computer Science. WG 1996. Lecture Notes in Computer Science, vol 1197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62559-3_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-62559-3_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62559-9

  • Online ISBN: 978-3-540-68072-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation