Graph transformation

From Wikipedia, the free encyclopedia

Merge arrows
 It has been suggested that this article or section be merged with Graph rewriting. (Discuss)

Graph transformation, or Graph rewriting, concerns the technique to create a new graph out of an original graph using some automatic machine. It has numerous applications, ranging from software verification to layout algorithms.

Graph transformations can be used as a computation abstraction. The basic idea is that the state of a computation can be represented as a graph, further steps in that computation can then be represented as transformation rules on that graph. Such rules consist of an original graph, which is to be matched to a subgraph in the complete state, and a replacing graph, which will replace the matched subgraph.

[edit] References

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