释义 |
- References
- Further reading
{{More citations needed|date=September 2016}}In computer science, 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. ReferencesFurther reading- {{cite book|last1=Ehrig |first1=H. |author2=R. Heckel; M. Korff; M. Löwe; L. Ribeiro; A. Wagner; A. Corradini |editor=Grzegorz Rozenberg |title=Handbook of Graph Grammars and Computing by Graph Transformation |chapterurl=http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.72.1644&rep=rep1&type=pdf |date=1997 |publisher=World Scientific |isbn=978-981-238-472-0 |pages=247–312 |chapter=Chapter 4. Algebraic approaches to graph transformation. Part II: single pushout approach and comparison with double pushout approach}}
{{compu-sci-stub}} 1 : Graph rewriting |