Single pushout graph rewriting
 | This article needs additional citations for verification. (September 2016) |
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[edit]
Further reading[edit]
- 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 (ed.). Handbook of Graph Grammars and Computing by Graph Transformation. World Scientific. pp. 247–312. CiteSeerX 10.1.1.72.1644. ISBN 978-981-238-472-0.
 | This computer science article is a stub. You can help Wikipedia by expanding it. |
 | This graph theory-related article is a stub. You can help Wikipedia by expanding it. |