Graph Matching Algorithm

A Graph Matching Algorithm is a graph search algorithm that can be implemented by a graph matching system to solve a graph matching task.

• Context:
  • It can be applied by a Graph Matching System.
  • It can make use of a Graph Distance Function.
  • It can range from being an Exact Graph Matching Algorithm to being an Approximate Graph Matching Algorithm.
  • …
• Example(s):
  • a Maximum Graph Matching Algorithm;
  • a Bipartite Graph Matching Algorithm;
  • a Maximum Common Subgraph (MCS) Algorithm.
  • …
• Counter-Example(s):
  • a Graph Edit Distance Algorithm;
  • a String Matching Algorithm.
• See: Graph Thoery, Combinatorial Optimization Algorithm.

---

---

References

2003a

• (Giunchiglia & Shvaiko, 2003) ⇒ Fausto Giunchiglia, and Pavel Shvaiko. (2003). “Semantic Matching.” In: The Knowledge Engineering Review, 18.

2003

• (Massaro & Pelillo, 2003) ⇒ Alessio Massaro, and Marcello Pelillo. (2003). “Matching Graphs by Pivoting.” In: Pattern Recognition Letters Journal, 24(8). doi:10.1016/S0167-8655(02)00256-8

---