Graph Rewriting Using a Single Pushout: A Comparison.

摘要

Recently two algebraic approaches to graph rewriting have been given which use only single pushouts. The authors compare both approaches. They show that they are almost the same, the only difference being the way dangling arcs are treated.