A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Face Recognition by Elastic Bunch Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Learning Appearance Models for Object Recognition
ECCV '96 Proceedings of the International Workshop on Object Representation in Computer Vision II
Structure-Based Similarity Search with Graph Histograms
DEXA '99 Proceedings of the 10th International Workshop on Database & Expert Systems Applications
A New Algorithm for Inexact Graph Matching
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 4 - Volume 4
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Graphical Models and Point Pattern Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Measuring the similarity of labeled graphs
ICCBR'03 Proceedings of the 5th international conference on Case-based reasoning: Research and Development
| Hi-index | 0.02 |
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if both graphs are of equal size and by subisomorphisms if one graph has fewer vertices than the other. Best fit isomorphisms and subisomorphisms amount to solutions of quadratic assignment problems and are computed exactly as well as approximately by minimum cost flow, linear assignment relaxations and related graph algorithms.