kb/data/en.wikipedia.org/wiki/Single_pushout_graph_rewriting-0.md

title	chunk	source	category	tags	date_saved	instance
Single pushout graph rewriting	1/1	https://en.wikipedia.org/wiki/Single_pushout_graph_rewriting	reference	science, encyclopedia	2026-05-05T11:38:55.571765+00:00	kb-cron

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 (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.