Jump to content

Single pushout graph rewriting

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Fadesga (talk | contribs) at 18:03, 11 August 2023 (→Further reading). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Single pushout graph rewriting" – news · newspapers · books · scholar · JSTOR (September 2016) (Learn how and when to remove this message)

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.

This computer science article is a stub. You can help Wikipedia by expanding it.

This graph theory-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Single_pushout_graph_rewriting&oldid=1169853127"

Hidden categories: