Skip to main content
SpringerLink
Log in

An algebraic formalism for graphs

  • Graphs And Grammars
  • Conference paper
  • First Online:
CAAP '86 (CAAP 1986)

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

Included in the following conference series:

Abstract

We provide an algebraic structure for the set of finite graphs, whence a notion of graph expression for defining them and a complete set of equational rules for manipulating expressions.

By working at the level of expressions, one derives from this algebraic formalism a notion of graph rewriting which is as powerful and conceptually simpler than the usual categorical approach of Ehrig and alii.

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.

6. References

  1. BAUDERON M., COURCELLE B., Graph expressions and graph rewritings, (Report 8525, University Bordeaux I, Dept Maths Info 1985)

    Google Scholar 

  2. COURCELLE B., Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars, To appear in Theor. Comp. Sci. (Report 8521, University Bordeaux I, Dept Maths Info 1985)

    Google Scholar 

  3. EHRIG H., Introduction to the algebraic theory of graphs, Lect. Notes in Comp. Sci. 73 Springer 1979 1–69

    Google Scholar 

  4. EHRIG H., KREOWSKI H-J., Push-out properties: An analysis of gluing constructions for graphs, Math. Nachr. 91 (1979) 135–149

    Google Scholar 

  5. EHRIG H., KREOWSKI H-J., MAGGIOLO-SCHETTINI A., ROSEN B R., WINKOWSKI J., Transformations of structures: An algebraic approach, Math. Systems Theory 14 (1981) 305–334

    Google Scholar 

  6. HABEL A., KREOWSKI H-J., On context free graphs languages generated by edge replacement, Lect. Notes in Comp. Sci. 153 Springer 1983, 143–158

    Google Scholar 

  7. RAOULT J.C., On graphs rewritings, Theor. Comp. Sci. 32 (1984) 114–128

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département de Mathématiques et d'Informatique Formation associée au CNRS, Université de Bordeaux I, F-33405, Talence, France

    Michel Bauderon & Bruno Courcelle

Authors
  1. Michel Bauderon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bruno Courcelle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paul Franchi-Zannettacci

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Bauderon, M., Courcelle, B. (1986). An algebraic formalism for graphs. In: Franchi-Zannettacci, P. (eds) CAAP '86. CAAP 1986. Lecture Notes in Computer Science, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022660

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16443-2

  • Online ISBN: 978-3-540-39783-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation