Graph transformation
 | Template:Wikify is deprecated. Please use a more specific cleanup template as listed in the documentation. |
Graph transformation 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.
References
- Graph Transformation and Graph Grammars
- Heckel, R. (2006). Graph transformation in a nutshell. Electronic Notes in Theoretical Computer Science 148 (1 SPEC. ISS.), pp. 187-198.
 | This redirect has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar redirects, in addition to a stub category. |
.svg?lang=en){kind=small} | This combinatorics-related article is a stub. You can help Wikipedia by expanding it. |