Inexact graph matching using a hierarchy of matching processes

DOI10.1007/s41095-015-0030-4zbMath1428.68223OpenAlexW2272191051MaRDI QIDQ2288126

Ju Jia Zou, Paul Morrison

Publication date: 17 January 2020

Published in: Computational Visual Media (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41095-015-0030-4

zbMATH Keywords

graph matchinggraph edit distanceshape matchinginexact graph matchinggraph edit operations

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Metric for Comparison of Graph-Theoretic Models of the Same Dimension with Ordered Vertices

Uses Software

• PatchNet
• BiggerPicture

Cites Work

• Unnamed Item
• Unnamed Item
• Applied graph theory in computer vision and pattern recognition
• Exact algorithms for edge domination
• Triangle refinement in a constrained Delaunay triangulation skeleton
• Computing optimal Steiner trees in polynomial space
• The graph matching problem
• Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
• A graph distance measure for image analysis
• Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis
• Subgraph error-correcting isomorphisms for syntactic pattern recognition
• Automata, Languages and Programming

This page was built for publication: Inexact graph matching using a hierarchy of matching processes