Generalized median graph computation by means of graph embedding in vector spaces

Development Therapeutics Program DTP. AIDS Antiviral Screen, 2004 〈http://dtp.nci.nih.gov/docs/aids/aids_data.html〉. Bajaj, 1988, The algebraic degree of geometric optimization problems, Discrete Comput. Geom., 3, 177, 10.1007/BF02187906 Bunke, 1983, Inexact graph matching for structural pattern recognition, Pattern Recognition Lett., 1, 245, 10.1016/0167-8655(83)90033-8 Bunke, 2001, Weighted mean of a pair of graphs, Computing, 67, 209, 10.1007/s006070170006 Conte, 2004, Thirty years of graph matching in pattern recognition, Int. J. Pattern Recognition Artif. Intell., 18, 265, 10.1142/S0218001404003228 de la Higuera, 2000, Topology of strings: median string is NP-complete, Theor. Comput. Sci., 230, 39, 10.1016/S0304-3975(97)00240-5 Demirci, 2006, Object recognition as many-to-many feature matching, Int. J. Comput. Vision, 69, 203, 10.1007/s11263-006-6993-y Dosch, 2005, Report on the second symbol recognition contest, vol. 3926 Duda, 2000 Ferrer, 2005, Synthesis of median spectral graph, vol. 3523 Friedman, 1999 K. Grauman, T. Darrell, Fast contour matching using approximate earth mover's distance, in: Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. Hakimi, 2000 Hlaoui, 2006, Median graph computation for graph clustering, Soft Comput., 10, 47, 10.1007/s00500-005-0464-1 P. Indyk, Algorithmic applications of low-distortion geometric embeddings, in: IEEE Symposium on Foundations of Computer Science, 2001. Jiang, 2001, On median graphs: properties, algorithms, and applications, IEEE Trans. Pattern Anal. Mach. Intell., 23, 1144, 10.1109/34.954604 Justice, 2006, A binary linear programming formulation of the graph edit distance, IEEE Trans. Pattern Anal. Mach. Intell., 28, 1200, 10.1109/TPAMI.2006.152 Luo, 2003, Spectral embedding of graphs, Pattern Recognition, 36, 2213, 10.1016/S0031-3203(03)00084-0 A. Münger, Synthesis of prototype graphs from sample graphs, Diploma Thesis, University of Bern, 1998 (in German). Neuhaus, 2004, An error-tolerant approximate matching algorithm for attributed planar graphs and its application to fingerprint classification, vol. 3138 Neuhaus, 2006, Fast suboptimal algorithms for the computation of graph edit distance, vol. 4109 Pekalska, 2006, Prototype selection for dissimilarity-based classifiers, Pattern Recognition, 39, 189, 10.1016/j.patcog.2005.06.012 K. Riesen, H. Bunke, IAM graph database repository for graph based pattern recognition and machine learning, in: SSPR/SPR, 2008. Riesen, 2009, Approximate graph edit distance computation by means of bipartite graph matching, Image Vision Comput., 27, 950, 10.1016/j.imavis.2008.04.004 Riesen, 2007, Graph embedding in vector spaces by means of prototype selection, vol. 4538 Robles-Kelly, 2007, A Riemannian approach to graph embedding, Pattern Recognition, 40, 1042, 10.1016/j.patcog.2006.05.031 Sanfeliu, 1983, A distance measure between attributed relational graphs for pattern recognition, IEEE Trans. Syst. Man Cybern., 13, 353, 10.1109/TSMC.1983.6313167 Schenker, 2005 Weiszfeld, 1937, Sur le point pour lequel la somme des distances de n points donnés est minimum, Tohoku Math. J., 43, 355 D. White, R.C. Wilson, Mixing spectral representations of graphs, in: 18th International Conference on Pattern Recognition (ICPR 2006), Hong Kong, China, IEEE Computer Society, 20–24 August 2006. Wilson, 2005, Pattern vectors from algebraic graph theory, IEEE Trans. Pattern Anal. Mach. Intell., 27, 1112, 10.1109/TPAMI.2005.145