Attributed graph grammar
Appearance
From Wikipedia, the free encyclopedia
In computer science, an attributed graph grammar is a class of graph grammar that associates vertices with a set of attributes and rewrites with functions on attributes. In the algebraic approach to graph grammars, they are usually formulated using the double-pushout approach or the single-pushout approach.
Implementation
[edit ]AGG, a rule-based visual language that directly expresses attributed graph grammars using the single-pushout approach has been developed at TU Berlin for many years.[1]
See also
[edit ]Notes
[edit ]- ^ Runge, Olga. "AGG Documentation" . Retrieved 2017年11月06日.
References
[edit ]- Rozenberg, Grzegorz (1997), Handbook of Graph Grammars and Computing by Graph Transformations, World Scientific Publishing, volumes 1–3, ISBN 9810228848 .
- Ehrig, Heckel, Korff, Lowe, Ribeiro, Wagner and Corradini, 1997. Algebraic Approaches to Graph Transformation - Part II: Single Pushout Approach and Comparison with Double Pushout Approach. Pp. 247-312 of (Rozenberg, 1997).
Stub icon
This graph theory-related article is a stub. You can help Wikipedia by expanding it.