Finding a maximum clique in an arbitrary graph
SIAM Journal on Computing
Model matching in robot vision by subgraph isomorphism
Pattern Recognition
On a relation between graph edit distance and maximum common subgraph
Pattern Recognition Letters
Pattern Recognition Letters - Special issue on pattern recognition in practice VI
Mean and maximum common subgraph of two graphs
Pattern Recognition Letters
On Median Graphs: Properties, Algorithms, and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Graph Edit Distance from Spectral Seriation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Novel Efficient Algorithm for Determining Maximum Common Subgraphs
IV '05 Proceedings of the Ninth International Conference on Information Visualisation
Median graph computation for graph clustering
Soft Computing - A Fusion of Foundations, Methodologies and Applications
A Binary Linear Programming Formulation of the Graph Edit Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Mixing spectral representations of graphs
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 04
Graph clustering using the weighted minimum common supergraph
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
On the relation between the median and the maximum common subgraph of a set of graphs
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
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
Inexact graph matching for structural pattern recognition
Pattern Recognition Letters
Models and algorithms for computing the common labelling of a set of attributed graphs
Computer Vision and Image Understanding
A generic framework for median graph computation based on a recursive embedding approach
Computer Vision and Image Understanding
Graph database retrieval based on metric-trees
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical 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.10 |
Median graphs have been presented as a useful tool for capturing the essential information of a set of graphs. Nevertheless, computation of optimal solutions is a very hard problem. In this work we present a new and more efficient optimal algorithm for the median graph computation. With the use of a particular cost function that permits the definition of the graph edit distance in terms of the maximum common subgraph, and a prediction function in the backtracking algorithm, we reduce the size of the search space, avoiding the evaluation of a great amount of states and still obtaining the exact median. We present a set of experiments comparing our new algorithm against the previous existing exact algorithm using synthetic data. In addition, we present the first application of the exact median graph computation to real data and we compare the results against an approximate algorithm based on genetic search. These experimental results show that our algorithm outperforms the previous existing exact algorithm and in addition show the potential applicability of the exact solutions to real problems.