Graph Matching Algorithms: A Survey
Shri Prakash Dwivedi, Ravi Shankar Singh · 2025
This chapter provides a comprehensive survey of graph matching algorithms, categorized based on exact and inexact matching techniques. It introduces key algorithms such as graph isomorphism, graph edit distance, and subgraph matching. The survey spans traditional combinatorial approaches to more recent techniques incorporating heuristics, relaxation, and learning-based methods. The chapter critically evaluates these algorithms in terms of accuracy, robustness, and computational complexity. It also discusses applications in various domains, highlighting the relevance and evolution of graph matching in practical structural pattern recognition tasks.