Approximate Graph Matching Algorithm

An Approximate Graph Matching Algorithm is a Graph Matching Algorithm that can solve an Approximate Graph Matching Task.

• Context:
  • It can be:
    • a Graph Edit Matching Algorithm.
• See: Exact Graph Matching Algorithm, Approximate Matching Algorithm.

---

---

References

1997

• (Bunke, 1997) ⇒ Horst Bunke. (1997). “On a Relation Between Graph Edit Distance and Maximum Common Subgraph.” In: Pattern Recognition Letters, 18(9).

---