A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Recognition Letters - Special issue on pattern recognition in practice VI
Graph indexing for spatial data traversal in road map databases
Computers and Operations Research
Efficient Matching and Indexing of Graph Models in Content-Based Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
On Median Graphs: Properties, Algorithms, and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Closure-Tree: An Index Structure for Graph Queries
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Image retrieval: Ideas, influences, and trends of the new age
ACM Computing Surveys (CSUR)
Solving Non-Uniqueness in Agglomerative Hierarchical Clustering Using Multidendrograms
Journal of Classification
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
Median graph: A new exact algorithm using a distance based on the maximum common subgraph
Pattern Recognition Letters
Region and constellations based categorization of images with unsupervised graph learning
Image and Vision Computing
Median graphs: A genetic approach based on new theoretical properties
Pattern Recognition
Graduated assignment algorithm for finding the common labelling of a set of graphs
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Models and algorithms for computing the common labelling of a set of attributed graphs
Computer Vision and Image Understanding
Graph indexing and retrieval based on median graphs
MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
A probabilistic framework to obtain a common labelling between attributed graphs
IbPRIA'11 Proceedings of the 5th Iberian conference on Pattern recognition and image analysis
K-nn queries in graph databases using M-trees
CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part I
Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Inexact graph matching based on kernels for object retrieval in image databases
Image and Vision Computing
Fast suboptimal algorithms for the computation of graph edit distance
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Feature selection for graph-based image classifiers
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Hypergraph-based image retrieval for graph-based representation
Pattern Recognition
Component retrieval based on a database of graphs for Hand-Written Electronic-Scheme Digitalisation
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
M-trees are well-know structures used to speed-up queries in databases. In this paper, we evaluate the applicability of m-trees to graph databases. In classical schemes based on metric-trees, the routing information kept in a metric-tree node is a selected element from the sub-cluster that represents. Nevertheless, defining a graph that represents a set of graphs is not a trivial task. We evaluate different graphs-class prototype as routing nodes in the metric tree. The considered prototypes are: Median Graphs, Closure Graphs, First-Order Random Graphs, Function-Described Graphs and Second-Order Random Graphs.