Approximate Graph Matching Task

An Approximate Graph Matching Task is a Graph Matching Task that allows for Mismatches within a Graph Distance Function Threshold.

• Context:
  • It can be supported by:
    • an Approximate Graph Node Matching Task.
    • an Approximate Graph Edge Matching Task.
• See: Approximate String Matching Task, Approximate Tuple Matching Task.

---