Exact Graph Matching Task

An Exact Graph Matching Task is a Graph Matching Task that must produce an exact graph match.

• Context:
  • It can (typically) include a Graph Node Identity Function and/or a Graph Edge Identity Function.
  • It can (typically) include a Graph Pattern.
  • …
• Counter-Example(s):
  • an Approximate Graph Matching Task.
• See: Bipartite Graph Matching.

---

---