Single Pushout Graph Rewriting
From Handwiki In computer science, a single pushout graph rewriting or SPO graph rewriting refers to a mathematical framework for graph rewriting, and is used in contrast to the double-pushout approach of graph rewriting.
References
Further reading
- Ehrig, H.; R. Heckel; M. Korff; M. Löwe; L. Ribeiro; A. Wagner; A. Corradini (1997). "Chapter 4. Algebraic approaches to graph transformation. Part II: single pushout approach and comparison with double pushout approach". in Grzegorz Rozenberg. Handbook of Graph Grammars and Computing by Graph Transformation. World Scientific. pp. 247–312. ISBN 978-981-238-472-0.
 |  |
Categories: [Graph rewriting]
↧ Download as ZWI file | Last modified: 04/19/2024 16:33:02 | 8 views
☰ Source: https://handwiki.org/wiki/Single_pushout_graph_rewriting | License: CC BY-SA 3.0
✘
ZWI is not signed. [what is this?]
ZWI viewer
by the 
KSF
KSF