Single pushout graph rewriting

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.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Single pushout graph rewriting. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Single_pushout_graph_rewriting&oldid=294694"