Single pushout graph rewriting
From HandWiki - Reading time: 1 min
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.
 |  |
Licensed under CC BY-SA 3.0 | Source: https://handwiki.org/wiki/Single_pushout_graph_rewriting12 views | Status: cached on August 19 2024 21:03:23↧ Download this article as ZWI file
EncycloReader
is supported by the 
KSF