Finding a maximum clique in an arbitrary graph
SIAM Journal on Computing
An introduction to genetic algorithms
An introduction to genetic algorithms
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
Pattern Recognition Letters - Special issue on pattern recognition in practice VI
A graph distance metric combining maximum common subgraph and minimum common supergraph
Pattern Recognition Letters
On Median Graphs: Properties, Algorithms, and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Using Genetic Algorithms to Solve NP-Complete Problems
Proceedings of the 3rd International Conference on Genetic Algorithms
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
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
Mixing spectral representations of graphs
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 04
Applied Graph Theory in Computer Vision and Pattern Recognition (Studies in Computational Intelligence)
Inexact graph matching using a genetic algorithm for image recognition
Pattern Recognition Letters
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Graph clustering using the weighted minimum common supergraph
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Bipartite graph matching for computing the edit distance of graphs
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
A quadratic programming approach to the graph edit distance problem
GbRPR'07 Proceedings of the 6th IAPR-TC-15 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
Spectral median graphs applied to graphical symbol recognition
CIARP'06 Proceedings of the 11th Iberoamerican conference on Progress in Pattern Recognition, Image Analysis and Applications
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
Synthesis of median spectral graph
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Genetic-based search for error-correcting graph isomorphism
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Inexact graph matching for structural pattern recognition
Pattern Recognition Letters
Large sample statistics in the domain of graphs
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Graph indexing and retrieval based on median graphs
MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
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
A comparison between structural and embedding methods for graph classification
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
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.01 |
Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical application has been very limited up to now. In this work we present two major contributions. On one side, and from a theoretical point of view, we show new theoretical properties of the median graph. On the other side, using these new properties, we present a new approximate algorithm based on the genetic search, that improves the computation of the median graph. Finally, we perform a set of experiments on real data, where none of the existing algorithms for the median graph computation could be applied up to now due to their computational complexity. With these results, we show how the concept of the median graph can be used in real applications and leaves the box of the only-theoretical concepts, demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs.