Graph Edit Operation
(Redirected from graph edit operation)
A Graph Edit Operation is an Edit Operation that can transform one Graph into some other Graph.
- Context:
- It can be:
- a Graph Node Insertion Operation or Graph Edge Insertion Operation.
- a Graph Node Deletion Operation or Graph Edge Deletion Operation.
- a Graph Edge Contraction Operation.
- a Graph Node Substitution Operation or Graph Edge Substitution Operation.
- a Graph Node Transposition Operation or Graph Edge Transposition Operation.
- It can support a Graph Edit Distance Function.
- It can be:
- See: String Edit Operation.
References
1998
- (Klein, 1998) ⇒ Philip N. Klein. (1998). “Computing the Edit-Distance Between Unrooted Ordered Trees. Algorithms — ESA’ 98. doi:10.1007/3-540-68530-8
- … Let A and B be two ordered trees. The edit distance between A and B is the minimum cost of a sequence of operations (contract an edge, uncontract an edge, modify the label of an edge) needed to transform A into B. …
1997
- (Bunke, 1997) ⇒ Horst Bunke. (1997). “On a Relation Between Graph Edit Distance and Maximum Common Subgraph.” In: Pattern Recognition Letters, 18(9).