Approximate Graph Matching Task: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - " <B><U>Context</U>:</B>" to " <B>Context</U>:</B>") |
m (Text replacement - ". ----" to ". ----") |
||
| Line 5: | Line 5: | ||
*** an [[Approximate Graph Edge Matching Task]]. | *** an [[Approximate Graph Edge Matching Task]]. | ||
* <B>See:</B> [[Approximate String Matching Task]], [[Approximate Tuple Matching Task]]. | * <B>See:</B> [[Approximate String Matching Task]], [[Approximate Tuple Matching Task]]. | ||
---- | ---- | ||
__NOTOC__ | __NOTOC__ | ||
[[Category:Concept]] | [[Category:Concept]] | ||
Latest revision as of 23:38, 26 December 2020
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:
- See: Approximate String Matching Task, Approximate Tuple Matching Task.