Single pushout graph rewriting

{{More citations needed|date=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

{{Reflist}}

Further reading

  • {{cite book|last1=Ehrig |first1=H. |author2=R. Heckel |author3=M. Korff |author4=M. Löwe |author5=L. Ribeiro |author6=A. Wagner |author7=A. Corradini |editor=Grzegorz Rozenberg |title=Handbook of Graph Grammars and Computing by Graph Transformation |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|citeseerx=10.1.1.72.1644 }}

Category:Graph rewriting

{{compu-sci-stub}}

{{graph-stub}}