![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Handbook of Graph Grammars 1997
- Grzegorz Rozenberg:
Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations. World Scientific 1997, ISBN 9810228848 - Joost Engelfriet, Grzegorz Rozenberg:
Node Replacement Graph Grammars. Handbook of Graph Grammars 1997: 1-94 - Frank Drewes, Hans-Jörg Kreowski, Annegret Habel:
Hyperedge Replacement, Graph Grammars. Handbook of Graph Grammars 1997: 95-162 - Andrea Corradini, Ugo Montanari, Francesca Rossi, Hartmut Ehrig, Reiko Heckel, Michael Löwe:
Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach. Handbook of Graph Grammars 1997: 163-246 - Hartmut Ehrig, Reiko Heckel, Martin Korff, Michael Löwe, Leila Ribeiro, Annika Wagner, Andrea Corradini:
Algebraic Approaches to Graph Transformation - Part II: Single Pushout Approach and Comparison with Double Pushout Approach. Handbook of Graph Grammars 1997: 247-312 - Bruno Courcelle:
The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic. Handbook of Graph Grammars 1997: 313-400 - Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
2-Structures - A Framework For Decomposition And Transformation Of Graphs. Handbook of Graph Grammars 1997: 401-478 - Andy Schürr:
Programmed Graph Replacement Systems. Handbook of Graph Grammars 1997: 479-546
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.