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.
We don't have any images related to Single pushout graph rewriting yet.
You can add one yourself here.
We don't have any YouTube videos related to Single pushout graph rewriting yet.
You can add one yourself here.
We don't have any PDF documents related to Single pushout graph rewriting yet.
You can add one yourself here.
We don't have any Books related to Single pushout graph rewriting yet.
You can add one yourself here.
We don't have any archived web articles related to Single pushout graph rewriting yet.
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 (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.