An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Model matching in robot vision by subgraph isomorphism
Pattern Recognition
On a relation between graph edit distance and maximum common subgraph
Pattern Recognition Letters
A graph distance metric based on the maximal common subgraph
Pattern Recognition Letters
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
A Linear Programming Approach for the Weighted Graph Matching Problem
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Attributed Graph Matching and Its Application to Image Analysis
ICIAP '95 Proceedings of the 8th International Conference on Image Analysis and Processing
Improved Simulated Annealing, Boltzmann Machine, and Attributed Graph Matching
Proceedings of the EURASIP Workshop 1990 on Neural Networks
SAGA: a subgraph matching tool for biological graphs
Bioinformatics
Fg-index: towards verification-free query processing on graph databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
A survey of graph edit distance
Pattern Analysis & Applications
Computing subgraph isomorphic queries using structural unification and minimum graph structures
Proceedings of the 2011 ACM Symposium on Applied Computing
Indexing with well-founded total order for faster subgraph isomorphism detection
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
a.SCatch: semantic structure for architectural floor plan retrieval
ICCBR'10 Proceedings of the 18th international conference on Case-Based Reasoning Research and Development
Genetic-based search for error-correcting graph isomorphism
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Pattern Recognition Letters
Graph-based retrieval of building information models for supporting the early design stages
Advanced Engineering Informatics
| Hi-index | 0.10 |
In this paper an extension to index-based subgraph matching is proposed. This extension significantly speeds up the indexing time for graphs where the nodes are labeled with a rather small amount of different classes. Furthermore, the needed storage amount is significantly reduced. In order to reduce the complexity, we introduce a weight function for labeled graphs. Using this weight function, a well-founded total order is defined on the weights of the labels. Inversions which violate the order are not allowed. A computational complexity analysis of the new preprocessing is given and its completeness is proven. Furthermore, in a number of practical experiments with randomly generated graphs the improvement of the new approach is shown. In experiments performed on random sample graphs, and on real-world datasets. The number of permutations for the real-world datasets have been decreased to a fraction of 10^-^5 and 10^-^8 in average compared to the original approach by Messmer. The novel indexing strategy makes indexing of larger graphs feasible, allowing for fast detection of subgraphs.