Discrete mathematics and its applications (2nd ed.)
Discrete mathematics and its applications (2nd ed.)
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)
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A survey of graph edit distance
Pattern Analysis & Applications
a.SCatch: semantic structure for architectural floor plan retrieval
ICCBR'10 Proceedings of the 18th international conference on Case-Based Reasoning Research and Development
A multi-agent system for the interpretation of architectural sketches
SBM'04 Proceedings of the First Eurographics conference on Sketch-Based Interfaces and Modeling
| Hi-index | 0.00 |
In this paper we present a method for a graph-based retrieval and its application in architectural floor plan retrieval. The proposed method is an extension of a well-known method for subgraph matching. This extension significantly reduces the storage amount and indexing time for graphs where the nodes are labeled with a rather small amount of different classes. In order to reduce the number of possible permutations, a weight function for labeled graphs is introduced and 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, the number of permutations has been decreased to a fraction of 10−18 in average compared to the original approach by Messmer. This makes indexing of larger graphs feasible, allowing for fast detection of subgraphs.