Graph Embedding in Vector Spaces by Means of Prototype Selection, Proc. of the 6th IAPR Int. Workshop on Graph-based Repr. in Pattern Recogn, vol.383393, 2007. ,
Towards the unication of structural and statistical pattern recognition, Pattern Recogn. Lett, vol.33, issue.7, p.811825, 2012. ,
Feature Construction with Version Spaces for Biochemical Applications, Proc. of the 18th ICML, 2001. ,
Vector Representation of Graphs: Application to the Classication of Symbols and Letters, Proc. of the Int ,
, Conf. on Doc. Anal. and Recogn, p.681685, 2009.
Graph Characterization via Ihara Coecients, IEEE Trans. on Neural Networks, vol.22, issue.2, p.233245, 2011. ,
Normalized Cuts and Image Segmentation, IEEE Trans. on PAMI, vol.22, issue.8, p.888905, 2000. ,
Graph Classication and Clustering Based on Vector Space Embedding, 2010. ,
Kernels for Structured Data, Inductive Logic Programming, vol.2583, p.6683, 2003. ,
, Recognizing Patterns in Signals, Speech, Images and Videos, vol.6388, p.7582, 2010.
Graph Isomorphisms and Automorphisms via Spectral Signatures, IEEE Trans. on PAMI, vol.35, issue.8, 2013. ,
An Eigendecomposition Approach to Weighted Graph Matching Problems, IEEE Trans. on PAMI, vol.10, issue.5, p.695703, 1988. ,
Inexact Graph Matching for Structural Pattern Recognition, Pattern Recogn. Lett, vol.1, issue.4, p.245253, 1983. ,
, Matching of Hypergraphs Algorithms, Applications, and Experiments, vol.91, p.131154, 2008.
Classy: fast clustering streams of call-graphs, Data Mining and Knowledge Discovery, vol.28, issue.5, p.15541585, 2014. ,
Two new graphs kernels in chemoinformatics, Pattern Recogn. Lett, vol.33, issue.15, 2012. ,
Character prototype selection for handwriting recognition in historical documents, Proc. of the 19th Europ. Signal Processing Conference, p.14351439, 2011. ,
, Comparing Stars: On Approximating Graph Edit Distance., PVLDB, vol.2, issue.1, p.2536, 2009.
Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979. ,
Speeding Up Graph Edit Distance Computation with a Bipartite Heuristic, in: Mining and Learning with Graphs, MLG, 2007. ,
A Hausdor Heuristic for Ecient Computation of Graph Edit Distance, Proc. of the Joint IAPR Int. Workshops, S+SSPR, vol.8392, 2014. ,
Approximation of graph edit distance based on Hausdor matching, Pattern Recogn, vol.48, issue.2, p.343, 2015. ,
DOI : 10.1016/j.patcog.2014.07.015
Suboptimal Graph Isomorphism using bipartite Matching, IJPRAI, vol.26, issue.6 ,
Approximate graph edit distance computation by means of bipartite graph matching, Image Vision Comput, vol.27, p.950959, 2009. ,
DOI : 10.1016/j.imavis.2008.04.004
Fast Suboptimal Algorithms for the Computation of Graph Edit Distance, Proc. of the Joint IAPR International Workshops, SSPR & SPR, 2006. ,
Bayesian Graph Edit Distance, IEEE Trans. on PAMI, vol.22, issue.6, p.628635, 2000. ,
DOI : 10.1109/iciap.1999.797761
URL : http://eprints.whiterose.ac.uk/1988/1/hancocker4.pdf
A graph matching method and a graph matching distance based on subgraph assignments ,
DOI : 10.1016/j.patrec.2009.10.011
URL : https://hal.archives-ouvertes.fr/hal-00442028
, Lett, vol.31, issue.5, p.394406, 2010.
A Binary Linear Programming Formulation of the Graph Edit Distance, IEEE Trans. on PAMI, vol.28, issue.8, p.12001214, 2006. ,
Datasets for the Evaluation of Substitution-Tolerant Subgraph Isomorphism, Graphics Recognition. Current Trends and Challenges, p.240251, 2014. ,
IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning, Proc. of the Joint IAPR Workshops S+SSPR, vol.5342, p.287297, 2008. ,
DOI : 10.1007/978-3-540-89689-0_33
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-89689-0_33.pdf
, , 2013.
On a relation between graph edit distance and maximum common subgraph, Pattern Recogn. Lett, vol.18, issue.8, p.689694, 1997. ,
DOI : 10.1016/s0167-8655(97)00060-3
A Graph Distance Metric Based on the Maximal Common Subgraph, Pattern Recogn. Lett, vol.19, p.255259, 1998. ,
DOI : 10.1016/s0167-8655(97)00179-7
, Bridging the Gap between Graph Edit Distance and Kernel Machines, vol.68, 2007.
DOI : 10.1142/9789812770202
Learning graph-matching edit-costs based on the optimality of the oracle's node correspondences, Pattern Recogn. Lett, vol.56, p.2229, 2015. ,
Learning Graph Matching, IEEE Trans. on PAMI, vol.31, issue.6, p.10481058, 2009. ,
DOI : 10.1109/tpami.2009.28
URL : http://arxiv.org/pdf/0806.2890
A Survey of Graph Edit Distance, Pattern Anal. Appl, vol.13, issue.1, p.113129, 2010. ,
DOI : 10.1007/s10044-008-0141-y
, Structural Pattern Recognition with Graph Edit Distance-Approximation Algorithms and Applications, 2015.
DOI : 10.1007/978-3-319-27252-8
A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Trans. on SMC, vol.4, issue.2, p.100107, 1968. ,
A Linear Programming Approach for the Weighted Graph Matching Problem, IEEE Trans. on PAMI, vol.15, issue.5, p.522525, 1993. ,
DOI : 10.1109/34.211474
URL : http://cbio.ensmp.fr/~jvert/svn/bibli/local/Almohamad1993linear.pdf
Algorithms for the Assignment and Transportation Problems, J. of the Society of Industrial and Applied Mathematics, vol.5, issue.1, p.3238, 1957. ,
DOI : 10.1137/0105003
URL : http://www.eecs.umich.edu/%7Epettie/matching/Munkres-variant-of-Hungarian-alg.pdf
Improving bipartite graph edit distance approximation using various search strategies, Pattern Recogn, vol.48, issue.4, pp.1349-1363, 2015. ,
DOI : 10.1016/j.patcog.2014.11.002
Integer programming, 1998. ,
Linear Programming: A Modern Integrated Analysis, 1995. ,
DOI : 10.1057/palgrave.jors.2600826
Fast computation of Bipartite graph matching, Pattern Recogn. Lett, vol.45, p.244250, 2014. ,
DOI : 10.1016/j.patrec.2014.04.015
Computation of graph edit distance: Reasoning about optimality and speed-up, Image Vision Comp, vol.40, p.3848, 2015. ,
DOI : 10.1016/j.imavis.2015.06.005