{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:00:26Z","timestamp":1725894026457},"publisher-location":"Berlin, Heidelberg","reference-count":133,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382208"},{"type":"electronic","value":"9783642382215"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38221-5_1","type":"book-chapter","created":{"date-parts":[[2013,5,6]],"date-time":"2013-05-06T00:48:12Z","timestamp":1367801292000},"page":"1-10","source":"Crossref","is-referenced-by-count":12,"title":["A One Hour Trip in the World of Graphs, Looking at the Papers of the Last Ten Years"],"prefix":"10.1007","author":[{"given":"Mario","family":"Vento","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"12","key":"1_CR1","doi-asserted-by":"publisher","first-page":"1428","DOI":"10.1016\/j.patrec.2007.02.013","volume":"28","author":"S. Auwatanamongkol","year":"2007","unstructured":"Auwatanamongkol, S.: Inexact graph matching using a genetic algorithm for image recognition. Pattern Recognition Letters (PRL)\u00a028(12), 1428\u20131437 (2007)","journal-title":"Pattern Recognition Letters (PRL)"},{"issue":"6","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1016\/S0031-3203(02)00227-3","volume":"36","author":"A.D. Bagdanov","year":"2003","unstructured":"Bagdanov, A.D., Worring, M.: First order gaussian graphs for efficient structure classification. PR\u00a036(6), 1311\u20131324 (2003)","journal-title":"PR"},{"issue":"7","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1109\/TPAMI.2007.70769","volume":"30","author":"X. Bai","year":"2008","unstructured":"Bai, X., Latecki, L.: Path similarity skeleton graph matching. IEEE Trans. on PAMI\u00a030(7), 1282\u20131292 (2008)","journal-title":"IEEE Trans. on PAMI"},{"issue":"12","key":"1_CR4","doi-asserted-by":"publisher","first-page":"2867","DOI":"10.1016\/S0031-3203(01)00232-1","volume":"35","author":"E. Bengoetxea","year":"2002","unstructured":"Bengoetxea, E., Larra\u00f1aga, P., Bloch, I., Perchant, A., Boeres, C.: Inexact graph matching by means of estimation of distribution algorithms. PR\u00a035(12), 2867\u20132880 (2002)","journal-title":"PR"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Bergamasco, F., Albarelli, A.: A graph-based technique for semi-supervised segmentation of 3D surfaces. PRL (2012) (in press)","DOI":"10.1007\/978-3-642-20844-7_23"},{"key":"1_CR6","unstructured":"Borzeshi, E.Z., Piccardi, M., Riesen, K., Bunke, H.: Discriminative prototype selection methods for graph embedding. PR (2012)"},{"issue":"7","key":"1_CR7","doi-asserted-by":"publisher","first-page":"2077","DOI":"10.1016\/j.patcog.2006.08.001","volume":"40","author":"N. Bourbakis","year":"2007","unstructured":"Bourbakis, N., Yuan, P., Makrogiannis, S.: Object recognition using wavelets, L-G graphs and synthesis of regions. PR\u00a040(7), 2077\u20132096 (2007)","journal-title":"PR"},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.patcog.2005.10.011","volume":"39","author":"H. Bunke","year":"2006","unstructured":"Bunke, H., Dickinson, P., Irniger, C., Kraetzl, M.: Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning. PR\u00a039(4), 573\u2013586 (2006)","journal-title":"PR"},{"issue":"9","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1928","DOI":"10.1016\/j.patcog.2010.05.016","volume":"44","author":"H. Bunke","year":"2011","unstructured":"Bunke, H., Riesen, K.: Improving vector space embedding of graphs through feature selection algorithms. PR\u00a044(9), 1928\u20131940 (2011)","journal-title":"PR"},{"issue":"5","key":"1_CR10","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1016\/j.patcog.2010.11.015","volume":"44","author":"H. Bunke","year":"2011","unstructured":"Bunke, H., Riesen, K.: Recent advances in graph-based pattern recognition with applications in document analysis. PR\u00a044(5), 1057\u20131067 (2011)","journal-title":"PR"},{"issue":"7","key":"1_CR11","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/j.patrec.2011.04.017","volume":"33","author":"H. Bunke","year":"2012","unstructured":"Bunke, H., Riesen, K.: Towards the unification of structural and statistical pattern recognition. PRL\u00a033(7), 811\u2013825 (2012)","journal-title":"PRL"},{"issue":"3","key":"1_CR12","first-page":"329","volume":"18","author":"T. Caelli","year":"2004","unstructured":"Caelli, T., Kosinov, S.: Inexact graph matching using eigen-subspace projection clustering. IJPRAI\u00a018(3), 329\u2013354 (2004)","journal-title":"IJPRAI"},{"issue":"6","key":"1_CR13","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"T. Caetano","year":"2009","unstructured":"Caetano, T., McAuley, J., Cheng, L., Le, Q., Smola, A.: Learning graph matching. IEEE Trans. on PAMI\u00a031(6), 1048\u20131058 (2009)","journal-title":"IEEE Trans. on PAMI"},{"issue":"3","key":"1_CR14","first-page":"265","volume":"18","author":"D. Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in Pattern Recognition. IJPRAI\u00a018(3), 265\u2013298 (2004)","journal-title":"IJPRAI"},{"issue":"4","key":"1_CR15","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/j.patcog.2005.10.012","volume":"39","author":"D. Conte","year":"2006","unstructured":"Conte, D., Foggia, P., Jolion, J.M., Vento, M.: A graph-based, multi-resolution algorithm for tracking objects in presence of occlusions. PR\u00a039(4), 562\u2013572 (2006)","journal-title":"PR"},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TPAMI.2007.70765","volume":"30","author":"M. Culp","year":"2008","unstructured":"Culp, M., Michailidis, G.: Graph-based semisupervised learning. IEEE Trans. on PAMI\u00a030(1), 174\u2013179 (2008)","journal-title":"IEEE Trans. on PAMI"},{"issue":"15","key":"1_CR17","doi-asserted-by":"publisher","first-page":"1968","DOI":"10.1016\/j.patrec.2012.03.024","volume":"33","author":"W. Czech","year":"2012","unstructured":"Czech, W.: Invariants of distance k-graphs for graph embedding. PRL\u00a033(15), 1968\u20131979 (2012)","journal-title":"PRL"},{"issue":"11","key":"1_CR18","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.1109\/TPAMI.2007.1115","volume":"29","author":"I. Dhillon","year":"2007","unstructured":"Dhillon, I., Guan, Y., Kulis, B.: Weighted graph cuts without eigenvectors: A multilevel approach. IEEE Trans. on PAMI\u00a029(11), 1944\u20131957 (2007)","journal-title":"IEEE Trans. on PAMI"},{"issue":"3","key":"1_CR19","first-page":"425","volume":"3","author":"P.J. Dickinson","year":"2004","unstructured":"Dickinson, P.J., Kraetzl, M., Bunke, H., Neuhaus, M., Dadej, A.: Similarity measures for hierarchical representations of graphs with unique node labels. IJPRAI\u00a018-3(3), 425\u2013442 (2004)","journal-title":"IJPRAI"},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10044-004-0222-5","volume":"7","author":"P.J. Dickinson","year":"2004","unstructured":"Dickinson, P.J., Bunke, H., Dadej, A., Kraetzl, M.: Matching graphs with unique node labels. Pattern Analysis & Applications\u00a07, 243\u2013254 (2004)","journal-title":"Pattern Analysis & Applications"},{"issue":"12","key":"1_CR21","doi-asserted-by":"publisher","first-page":"2383","DOI":"10.1109\/TPAMI.2011.110","volume":"33","author":"O. Duchenne","year":"2011","unstructured":"Duchenne, O., Bach, F., Kweon, I.S., Ponce, J.: A tensor-based algorithm for high-order graph matching. IEEE Trans. on PAMI\u00a033(12), 2383\u20132395 (2011)","journal-title":"IEEE Trans. on PAMI"},{"issue":"7","key":"1_CR22","doi-asserted-by":"publisher","first-page":"2788","DOI":"10.1016\/j.patcog.2012.01.005","volume":"45","author":"A. Ducournau","year":"2012","unstructured":"Ducournau, A., Bretto, A., Rital, S., Laget, B.: A reductive approach to hypergraph clustering: An application to image segmentation. PR\u00a045(7), 2788\u20132803 (2012)","journal-title":"PR"},{"issue":"5","key":"1_CR23","first-page":"985","volume":"42","author":"D. Emms","year":"2009","unstructured":"Emms, D., Wilson, R.C., Hancock, E.R.: Graph matching using the interference of continuous-time quantum walks. PR\u00a042(5), 985\u20131002 (2009)","journal-title":"PR"},{"issue":"4","key":"1_CR24","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TPAMI.2010.135","volume":"33","author":"P. Felzenszwalb","year":"2011","unstructured":"Felzenszwalb, P., Zabih, R.: Dynamic programming and graph algorithms in computer vision. IEEE Trans. on PAMI\u00a033(4), 721\u2013740 (2011)","journal-title":"IEEE Trans. on PAMI"},{"issue":"1","key":"1_CR25","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1109\/34.982887","volume":"24","author":"J.A. Fernandez-Madrigal","year":"2002","unstructured":"Fernandez-Madrigal, J.A., Gonzalez, J.: Multihierarchical graph search. IEEE Trans. on PAMI\u00a024(1), 103\u2013113 (2002)","journal-title":"IEEE Trans. on PAMI"},{"issue":"7","key":"1_CR26","first-page":"919","volume":"115","author":"M. Ferrer","year":"2011","unstructured":"Ferrer, M., Karatzas, D., Valveny, E., Bardaji, I., Bunke, H.: A generic framework for median graph computation based on a recursive embedding approach. CVIU\u00a0115(7), 919\u2013928 (2011)","journal-title":"CVIU"},{"issue":"5","key":"1_CR27","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/j.patrec.2008.12.014","volume":"30","author":"M. Ferrer","year":"2009","unstructured":"Ferrer, M., Valveny, E., Serratosa, F.: Median graph: A new exact algorithm using a distance based on the maximum common subgraph. PRL\u00a030(5), 579\u2013588 (2009)","journal-title":"PRL"},{"issue":"9","key":"1_CR28","first-page":"2003","volume":"42","author":"M. Ferrer","year":"2009","unstructured":"Ferrer, M., Valveny, E., Serratosa, F.: Median graphs: A genetic approach based on new theoretical properties. PR\u00a042(9), 2003\u20132012 (2009)","journal-title":"PR"},{"issue":"4","key":"1_CR29","first-page":"1642","volume":"43","author":"M. Ferrer","year":"2010","unstructured":"Ferrer, M., Valveny, E., Serratosa, F., Riesen, K., Bunke, H.: Generalized median graph computation by means of graph embedding in vector spaces. PR\u00a043(4), 1642\u20131655 (2010)","journal-title":"PR"},{"issue":"5","key":"1_CR30","first-page":"843","volume":"22","author":"P. Foggia","year":"2008","unstructured":"Foggia, P., Percannella, G., Sansone, C., Vento, M.: A graph-based algorithm for cluster detection. IJPRAI\u00a022(5), 843\u2013860 (2008)","journal-title":"IJPRAI"},{"issue":"11","key":"1_CR31","doi-asserted-by":"publisher","first-page":"1875","DOI":"10.1109\/TPAMI.2006.227","volume":"28","author":"P. Fr\u00e4nti","year":"2006","unstructured":"Fr\u00e4nti, P., Virmajoki, O., Hautamaki, V.: Fast agglomerative clustering using a k-nearest neighbor graph. IEEE Trans. on PAMI\u00a028(11), 1875\u20131881 (2006)","journal-title":"IEEE Trans. on PAMI"},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X. Gao","year":"2010","unstructured":"Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Analysis & Applications\u00a013, 113\u2013129 (2010), doi:10.1007\/s10044-008-0141-y","journal-title":"Pattern Analysis & Applications"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Gauzere, B., Brun, L., Villemin, D.: Two new graphs kernels in chemoinformatics. PRL (2012) (in press)","DOI":"10.1016\/j.patrec.2012.03.020"},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-642-20844-7_25","volume-title":"Graph-Based Representations in Pattern Recognition","author":"M. Gerstmayer","year":"2011","unstructured":"Gerstmayer, M., Haxhimusa, Y., Kropatsch, W.: Hierarchical interactive image segmentation using irregular pyramids. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol.\u00a06658, pp. 245\u2013254. Springer, Heidelberg (2011)"},{"issue":"15","key":"1_CR35","doi-asserted-by":"publisher","first-page":"1980","DOI":"10.1016\/j.patrec.2012.03.017","volume":"33","author":"J. Gibert","year":"2012","unstructured":"Gibert, J., Valveny, E., Bunke, H.: Feature selection on node statistics based embedding of graphs. PRL\u00a033(15), 1980\u20131990 (2012)","journal-title":"PRL"},{"issue":"9","key":"1_CR36","first-page":"3072","volume":"45","author":"J. Gibert","year":"2012","unstructured":"Gibert, J., Valveny, E., Bunke, H.: Graph embedding in vector spaces by node attribute statistics. PR\u00a045(9), 3072\u20133083 (2012)","journal-title":"PR"},{"issue":"7","key":"1_CR37","first-page":"1011","volume":"115","author":"R. Gonzalez-Diaz","year":"2011","unstructured":"Gonzalez-Diaz, R., Ion, A., Iglesias-Ham, M., Kropatsch, W.G.: Invariant representative cocycles of cohomology generators using irregular graph pyramids. CVIU\u00a0115(7), 1011\u20131022 (2011)","journal-title":"CVIU"},{"issue":"7","key":"1_CR38","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1109\/TPAMI.2005.138","volume":"27","author":"M. Gori","year":"2005","unstructured":"Gori, M., Maggini, M., Sarti, L.: Exact and approximate graph matching using random walks. IEEE Trans. on PAMI\u00a027(7), 1100\u20131111 (2005)","journal-title":"IEEE Trans. on PAMI"},{"issue":"8","key":"1_CR39","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1016\/S0167-8655(02)00252-0","volume":"24","author":"L. Guigues","year":"2003","unstructured":"Guigues, L., Le Men, H., Cocquerez, J.P.: The hierarchy of the cocoons of a graph and its application to image segmentation. PRL\u00a024(8), 1059\u20131066 (2003)","journal-title":"PRL"},{"issue":"4","key":"1_CR40","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/S0167-8655(01)00173-8","volume":"23","author":"S. G\u00fcnter","year":"2002","unstructured":"G\u00fcnter, S., Bunke, H.: Self-organizing map for clustering in the graph domain. PRL\u00a023(4), 405\u2013417 (2002)","journal-title":"PRL"},{"issue":"8","key":"1_CR41","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1016\/S0167-8655(02)00257-X","volume":"24","author":"S. G\u00fcnter","year":"2003","unstructured":"G\u00fcnter, S., Bunke, H.: Validation indices for graph clustering. PRL\u00a024(8), 1107\u20131113 (2003)","journal-title":"PRL"},{"issue":"8","key":"1_CR42","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1016\/S0167-8655(02)00254-4","volume":"24","author":"M. Hagenbuchner","year":"2003","unstructured":"Hagenbuchner, M., Gori, M., Bunke, H., Tsoi, A.C., Irniger, C.: Using attributed plex grammars for the generation of image and graph databases. PRL\u00a024(8), 1081\u20131087 (2003)","journal-title":"PRL"},{"issue":"7","key":"1_CR43","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.patrec.2011.08.012","volume":"33","author":"E.R. Hancock","year":"2012","unstructured":"Hancock, E.R., Wilson, R.C.: Pattern analysis with graphs: Parallel work at bern and york. PRL\u00a033(7), 833\u2013841 (2012)","journal-title":"PRL"},{"issue":"7","key":"1_CR44","first-page":"1557","volume":"37","author":"L. He","year":"2004","unstructured":"He, L., Han, C.Y., Everding, B., Wee, W.G.: Graph matching for object recognition and recovery. PR\u00a037(7), 1557\u20131560 (2004)","journal-title":"PR"},{"issue":"3","key":"1_CR45","first-page":"299","volume":"18","author":"D. Hidovi\u0107","year":"2004","unstructured":"Hidovi\u0107, D., Pelillo, M.: Metrics for attributed graphs based on the maximal similarity common subgraph. IJPRAI\u00a018(3), 299\u2013313 (2004)","journal-title":"IJPRAI"},{"issue":"5","key":"1_CR46","first-page":"1147","volume":"39","author":"W. Hu","year":"2009","unstructured":"Hu, W., Hu, W., Xie, N., Maybank, S.: Unsupervised active learning based on hierarchical graph-theoretic clustering. IEEE Trans. on SMC-B\u00a039(5), 1147\u20131161 (2009)","journal-title":"IEEE Trans. on SMC-B"},{"issue":"7","key":"1_CR47","first-page":"946","volume":"115","author":"B.J. Jain","year":"2011","unstructured":"Jain, B.J., Obermayer, K.: Graph quantization. CVIU\u00a0115(7), 946\u2013961 (2011)","journal-title":"CVIU"},{"issue":"11","key":"1_CR48","first-page":"2099","volume":"38","author":"R.M. Cesar Jr.","year":"2005","unstructured":"Cesar Jr., R.M., Bengoetxea, E., Bloch, I., Larra\u00f1aga, P.: Inexact graph matching for model-based recognition: Evaluation and comparison of optimization algorithms. PR\u00a038(11), 2099\u20132113 (2005)","journal-title":"PR"},{"issue":"8","key":"1_CR49","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1109\/TPAMI.2006.152","volume":"28","author":"D. Justice","year":"2006","unstructured":"Justice, D., Hero, A.: A binary linear programming formulation of the graph edit distance. IEEE Trans. on PAMI\u00a028(8), 1200\u20131214 (2006)","journal-title":"IEEE Trans. on PAMI"},{"issue":"8","key":"1_CR50","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1016\/S0167-8655(02)00250-7","volume":"24","author":"P. Kammerer","year":"2003","unstructured":"Kammerer, P., Glantz, R.: Segmentation of brush strokes by saliency preserving dual graph contraction. PRL\u00a024(8), 1043\u20131050 (2003)","journal-title":"PRL"},{"issue":"13","key":"1_CR51","doi-asserted-by":"publisher","first-page":"2042","DOI":"10.1016\/j.patrec.2005.02.011","volume":"26","author":"H.W. Kang","year":"2005","unstructured":"Kang, H.W.: G-wire: A livewire segmentation algorithm based on a generalized graph formulation. PRL\u00a026(13), 2042\u20132051 (2005)","journal-title":"PRL"},{"issue":"3","key":"1_CR52","first-page":"914","volume":"43","author":"D.H. Kim","year":"2010","unstructured":"Kim, D.H., Yun, I.D., Lee, S.U.: Attributed relational graph matching based on the nested assignment structure. PR\u00a043(3), 914\u2013928 (2010)","journal-title":"PR"},{"issue":"5","key":"1_CR53","first-page":"735","volume":"42","author":"J.S. Kim","year":"2009","unstructured":"Kim, J.S., Hong, K.S.: Colortexture segmentation using unsupervised graph cuts. PR\u00a042(5), 735\u2013750 (2009)","journal-title":"PR"},{"issue":"12","key":"1_CR54","first-page":"3988","volume":"43","author":"E. Kokiopoulou","year":"2010","unstructured":"Kokiopoulou, E., Frossard, P.: Graph-based classification of multiple observation sets. PR\u00a043(12), 3988\u20133997 (2010)","journal-title":"PR"},{"issue":"11","key":"1_CR55","first-page":"2392","volume":"42","author":"E. Kokiopoulou","year":"2009","unstructured":"Kokiopoulou, E., Saad, Y.: Enhanced graph-based dimensionality reduction with repulsion laplaceans. PR\u00a042(11), 2392\u20132402 (2009)","journal-title":"PR"},{"issue":"3","key":"1_CR56","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.patrec.2004.10.020","volume":"26","author":"A. Kostin","year":"2005","unstructured":"Kostin, A., Kittler, J., Christmas, W.: Object recognition by symmetrised graph matching using relaxation labelling with an inhibitory mechanism. PRL\u00a026(3), 381\u2013393 (2005)","journal-title":"PRL"},{"issue":"12","key":"1_CR57","first-page":"38","volume":"107","author":"O. Lezoray","year":"2007","unstructured":"Lezoray, O., Elmoataz, A., Bougleux, S.: Graph regularization for color image processing. CVIU\u00a0107(12), 38\u201355 (2007)","journal-title":"CVIU"},{"issue":"8","key":"1_CR58","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.1109\/TPAMI.2009.150","volume":"32","author":"L. Lin","year":"2010","unstructured":"Lin, L., Liu, X., Zhu, S.C.: Layered graph matching with composite cluster sampling. IEEE Trans. on PAMI\u00a032(8), 1426\u20131442 (2010)","journal-title":"IEEE Trans. on PAMI"},{"issue":"4","key":"1_CR59","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.patrec.2007.10.018","volume":"29","author":"J. Liu","year":"2008","unstructured":"Liu, J., Wang, B., Lu, H., Ma, S.: A graph-based image annotation framework. PRL\u00a029(4), 407\u2013415 (2008)","journal-title":"PRL"},{"issue":"3","key":"1_CR60","first-page":"455","volume":"18","author":"J. Llad\u00f3s","year":"2004","unstructured":"Llad\u00f3s, J., S\u00e1nchez, G.: Graph matching versus graph parsing in graphics recognition: A combined approach. IJPRAI\u00a018(3), 455\u2013473 (2004)","journal-title":"IJPRAI"},{"issue":"10","key":"1_CR61","first-page":"2213","volume":"36","author":"B. Luo","year":"2003","unstructured":"Luo, B., Wilson, R.C., Hancock, E.R.: Spectral embedding of graphs. PR\u00a036(10), 2213\u20132230 (2003)","journal-title":"PR"},{"issue":"6","key":"1_CR62","first-page":"1188","volume":"39","author":"B. Luo","year":"2006","unstructured":"Luo, B., Wilson, R.C., Hancock, E.R.: A spectral approach to learning structural variations in graphs. PR\u00a039(6), 1188\u20131198 (2006)","journal-title":"PR"},{"issue":"9","key":"1_CR63","first-page":"2592","volume":"40","author":"F. Ma","year":"2007","unstructured":"Ma, F., Bajger, M., Slavotinek, J.P., Bottema, M.J.: Two graph theory based methods for identifying the pectoral muscle in mammograms. PR\u00a040(9), 2592\u20132602 (2007)","journal-title":"PR"},{"issue":"7","key":"1_CR64","first-page":"1044","volume":"115","author":"D. Macrini","year":"2011","unstructured":"Macrini, D., Dickinson, S., Fleet, D., Siddiqi, K.: Bone graphs: Medial shape parsing and abstraction. CVIU\u00a0115(7), 1044\u20131061 (2011)","journal-title":"CVIU"},{"issue":"8","key":"1_CR65","first-page":"1187","volume":"115","author":"D. Macrini","year":"2011","unstructured":"Macrini, D., Dickinson, S., Fleet, D., Siddiqi, K.: Object categorization using bone graphs. CVIU\u00a0115(8), 1187\u20131206 (2011)","journal-title":"CVIU"},{"issue":"6","key":"1_CR66","first-page":"1212","volume":"44","author":"A. Mantrach","year":"2011","unstructured":"Mantrach, A., van Zeebroeck, N., Francq, P., Shimbo, M., Bersini, H., Saerens, M.: Semi-supervised classification and betweenness computation on large, sparse, directed graphs. PR\u00a044(6), 1212\u20131224 (2011)","journal-title":"PR"},{"issue":"1","key":"1_CR67","first-page":"72","volume":"95","author":"A.M. Mart\u00ednez","year":"2004","unstructured":"Mart\u00ednez, A.M., Mittrapiyanuruk, P., Kak, A.C.: On combining graph-partitioning with non-parametric clustering for image segmentation. CVIU\u00a095(1), 72\u201385 (2004)","journal-title":"CVIU"},{"issue":"8","key":"1_CR68","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1016\/S0167-8655(02)00256-8","volume":"24","author":"A. Massaro","year":"2003","unstructured":"Massaro, A., Pelillo, M.: Matching graphs by pivoting. PRL\u00a024(8), 1099\u20131106 (2003)","journal-title":"PRL"},{"issue":"6","key":"1_CR69","first-page":"867","volume":"38","author":"U. Maulik","year":"2008","unstructured":"Maulik, U.: Hierarchical pattern discovery in graphs. IEEE Trans. on SMC-C\u00a038(6), 867\u2013872 (2008)","journal-title":"IEEE Trans. on SMC-C"},{"issue":"8","key":"1_CR70","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1016\/S0167-8655(02)00258-1","volume":"24","author":"C. Mauro de","year":"2003","unstructured":"de Mauro, C., Diligenti, M., Gori, M., Maggini, M.: Similarity learning for graph-based image representations. PRL\u00a024(8), 1115\u20131122 (2003)","journal-title":"PRL"},{"issue":"3","key":"1_CR71","first-page":"503","volume":"35","author":"M. Neuhaus","year":"2005","unstructured":"Neuhaus, M., Bunke, H.: Self-organizing maps for learning the edit costs in graph matching. IEEE Trans. on SMC-B\u00a035(3), 503\u2013514 (2005)","journal-title":"IEEE Trans. on SMC-B"},{"issue":"10","key":"1_CR72","first-page":"1852","volume":"39","author":"M. Neuhaus","year":"2006","unstructured":"Neuhaus, M., Bunke, H.: Edit distance-based kernel functions for structural pattern classification. PR\u00a039(10), 1852\u20131863 (2006)","journal-title":"PR"},{"issue":"1","key":"1_CR73","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ins.2006.02.013","volume":"177","author":"M. Neuhaus","year":"2007","unstructured":"Neuhaus, M., Bunke, H.: Automatic learning of cost functions for graph edit distance. Information Sciences\u00a0177(1), 239\u2013247 (2007)","journal-title":"Information Sciences"},{"issue":"1","key":"1_CR74","first-page":"22","volume":"39","author":"H. Qiu","year":"2006","unstructured":"Qiu, H., Hancock, E.R.: Graph matching and clustering using spectral partitions. PR\u00a039(1), 22\u201334 (2006)","journal-title":"PR"},{"issue":"10","key":"1_CR75","first-page":"2874","volume":"40","author":"H. Qiu","year":"2007","unstructured":"Qiu, H., Hancock, E.R.: Graph simplification and matching using commute times. PR\u00a040(10), 2874\u20132889 (2007)","journal-title":"PR"},{"issue":"7","key":"1_CR76","first-page":"905","volume":"115","author":"R. Raveaux","year":"2011","unstructured":"Raveaux, R., Adam, S., H\u00e9roux, P., Trupin, \u00c9.: Learning graph prototypes for shape recognition. CVIU\u00a0115(7), 905\u2013918 (2011)","journal-title":"CVIU"},{"issue":"5","key":"1_CR77","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.patrec.2009.10.011","volume":"31","author":"R. Raveaux","year":"2010","unstructured":"Raveaux, R., Burie, J.C., Ogier, J.M.: A graph matching method and a graph matching distance based on subgraph assignments. PRL\u00a031(5), 394\u2013406 (2010)","journal-title":"PRL"},{"issue":"6","key":"1_CR78","first-page":"1472","volume":"39","author":"K. Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Graph classification by means of lipschitz embedding. IEEE Trans. on SMC-B\u00a039(6), 1472\u20131483 (2009)","journal-title":"IEEE Trans. on SMC-B"},{"issue":"7","key":"1_CR79","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K. Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision Computing\u00a027(7), 950\u2013959 (2009)","journal-title":"Image and Vision Computing"},{"key":"1_CR80","first-page":"1053","volume":"23","author":"K. Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Graph classification based on vector space embedding. IJPRAI\u00a023, 1053\u20131081 (2009)","journal-title":"IJPRAI"},{"key":"1_CR81","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.engappai.2008.04.006","volume":"22","author":"K. Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Reducing the dimensionality of dissimilarity space embedding graph kernels. Engineering Applications of Artificial Intelligence\u00a022, 48\u201356 (2009)","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"3","key":"1_CR82","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TPAMI.2005.56","volume":"27","author":"A. Robles-Kelly","year":"2005","unstructured":"Robles-Kelly, A., Hancock, E.: Graph edit distance from spectral seriation. IEEE Trans. on PAMI\u00a027(3), 365\u2013378 (2005)","journal-title":"IEEE Trans. on PAMI"},{"issue":"3","key":"1_CR83","first-page":"315","volume":"18","author":"A. Robles-Kelly","year":"2004","unstructured":"Robles-Kelly, A., Hancock, E.R.: String edit distance, random walks and graph matching. IJPRAI\u00a018(3), 315\u2013327 (2004)","journal-title":"IJPRAI"},{"issue":"8","key":"1_CR84","first-page":"1167","volume":"38","author":"A. Robles-Kelly","year":"2005","unstructured":"Robles-Kelly, A., Hancock, E.R.: A graph-spectral method for surface height recovery. PR\u00a038(8), 1167\u20131186 (2005)","journal-title":"PR"},{"issue":"3","key":"1_CR85","first-page":"1042","volume":"40","author":"A. Robles-Kelly","year":"2007","unstructured":"Robles-Kelly, A., Hancock, E.R.: A riemannian approach to graph embedding. PR\u00a040(3), 1042\u20131056 (2007)","journal-title":"PR"},{"issue":"4","key":"1_CR86","first-page":"1363","volume":"45","author":"M.H. Rohban","year":"2012","unstructured":"Rohban, M.H., Rabiee, H.R.: Supervised neighborhood graph construction for semi-supervised classification. PR\u00a045(4), 1363\u20131372 (2012)","journal-title":"PR"},{"issue":"7","key":"1_CR87","first-page":"984","volume":"115","author":"S. Rota Bul\u00f2","year":"2011","unstructured":"Rota Bul\u00f2, S., Pelillo, M., Bomze, I.M.: Graph-based quadratic optimization: A fast evolutionary approach. CVIU\u00a0115(7), 984\u2013995 (2011)","journal-title":"CVIU"},{"issue":"1","key":"1_CR88","first-page":"21","volume":"37","author":"C.D. Ruberto","year":"2004","unstructured":"Ruberto, C.D.: Recognition of shapes by attributed skeletal graphs. PR\u00a037(1), 21\u201331 (2004)","journal-title":"PR"},{"issue":"6","key":"1_CR89","first-page":"1163","volume":"37","author":"S. da","year":"2004","unstructured":"da, S., Torres, R., Falc\u00e3o, A., da, F., Costa, L.: A graph-based approach for multiscale shape analysis. PR\u00a037(6), 1163\u20131174 (2004)","journal-title":"PR"},{"issue":"3","key":"1_CR90","first-page":"639","volume":"35","author":"A. Sanfeliu","year":"2002","unstructured":"Sanfeliu, A., Alqu\u00e9zar, R., Andrade, J., Climent, J., Serratosa, F., Verg\u00e9s, J.: Graph-based representations and techniques for image processing and image analysis. PR\u00a035(3), 639\u2013650 (2002)","journal-title":"PR"},{"issue":"3","key":"1_CR91","first-page":"375","volume":"18","author":"A. Sanfeliu","year":"2004","unstructured":"Sanfeliu, A., Serratosa, F., Alquezar, R.: Second-order random graphs for modeling sets of attributed graphs and their application to object learning and recognition. IJPRAI\u00a018(3), 375\u2013396 (2004)","journal-title":"IJPRAI"},{"issue":"2","key":"1_CR92","first-page":"292","volume":"116","author":"G. Sanrom\u00e0","year":"2012","unstructured":"Sanrom\u00e0, G., Alqu\u00e9zar, R., Serratosa, F.: A new graph matching method for point-set correspondence using the em algorithm and softassign. CVIU\u00a0116(2), 292\u2013304 (2012)","journal-title":"CVIU"},{"issue":"8","key":"1_CR93","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/S0167-8655(02)00253-2","volume":"24","author":"M.D. Santo","year":"2003","unstructured":"Santo, M.D., Foggia, P., Sansone, C., Vento, M.: A large database of graphs and its use for benchmarking graph isomorphism algorithms. PRL\u00a024(8), 1067\u20131079 (2003)","journal-title":"PRL"},{"key":"1_CR94","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00180-009-0158-8","volume":"25","author":"E.R. Scheinerman","year":"2010","unstructured":"Scheinerman, E.R., Tucker, K.: Modeling graphs using dot product representations. Computational Statistics\u00a025, 1\u201316 (2010)","journal-title":"Computational Statistics"},{"issue":"5","key":"1_CR95","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/TPAMI.2004.1273924","volume":"26","author":"T. Sebastian","year":"2004","unstructured":"Sebastian, T., Klein, P., Kimia, B.: Recognition of shapes by editing their shock graphs. IEEE Trans. on PAMI\u00a026(5), 550\u2013571 (2004)","journal-title":"IEEE Trans. on PAMI"},{"issue":"6","key":"1_CR96","first-page":"621","volume":"16","author":"F. Serratosa","year":"2002","unstructured":"Serratosa, F., Alquezar, R., Sanfeliu, A.: Synthesis of function-described graphs and clustering of attributed graphs. IJPRAI\u00a016(6), 621\u2013655 (2002)","journal-title":"IJPRAI"},{"issue":"3","key":"1_CR97","first-page":"781","volume":"36","author":"F. Serratosa","year":"2003","unstructured":"Serratosa, F., Alqu\u00e9zar, R., Sanfeliu, A.: Function-described graphs for modelling objects represented by sets of attributed graphs. PR\u00a036(3), 781\u2013798 (2003)","journal-title":"PR"},{"issue":"6","key":"1_CR98","first-page":"2237","volume":"45","author":"F. Shang","year":"2012","unstructured":"Shang, F., Jiao, L., Wang, F.: Graph dual regularization non-negative matrix factorization for co-clustering. PR\u00a045(6), 2237\u20132250 (2012)","journal-title":"PR"},{"issue":"3","key":"1_CR99","first-page":"1035","volume":"45","author":"M. Shiga","year":"2012","unstructured":"Shiga, M., Mamitsuka, H.: Efficient semi-supervised learning on locally informative multiple graphs. PR\u00a045(3), 1035\u20131049 (2012)","journal-title":"PR"},{"issue":"5","key":"1_CR100","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/j.patrec.2006.10.003","volume":"28","author":"M. Skomorowski","year":"2007","unstructured":"Skomorowski, M.: Syntactic recognition of distorted patterns by means of random graph parsing. PRL\u00a028(5), 572\u2013581 (2007)","journal-title":"PRL"},{"issue":"7","key":"1_CR101","first-page":"929","volume":"115","author":"A. Sol\u00e9-Ribalta","year":"2011","unstructured":"Sol\u00e9-Ribalta, A., Serratosa, F.: Models and algorithms for computing the common labelling of a set of attributed graphs. CVIU\u00a0115(7), 929\u2013945 (2011)","journal-title":"CVIU"},{"key":"1_CR102","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.artint.2010.05.002","volume":"174","author":"C. Solnon","year":"2010","unstructured":"Solnon, C.: AllDifferent-based filtering for subgraph isomorphism. Artificial Intelligence\u00a0174, 850\u2013864 (2010)","journal-title":"Artificial Intelligence"},{"issue":"4","key":"1_CR103","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TPAMI.2006.76","volume":"28","author":"B. Sumengen","year":"2006","unstructured":"Sumengen, B., Manjunath, B.: Graph partitioning active contours (gpac) for image segmentation. IEEE Trans. on PAMI\u00a028(4), 509\u2013521 (2006)","journal-title":"IEEE Trans. on PAMI"},{"issue":"1","key":"1_CR104","first-page":"156","volume":"39","author":"H. Tang","year":"2006","unstructured":"Tang, H., Fang, T., Shi, P.F.: Nonlinear discriminant mapping using the laplacian of a graph. PR\u00a039(1), 156\u2013159 (2006)","journal-title":"PR"},{"issue":"10","key":"1_CR105","first-page":"3768","volume":"45","author":"J. Tang","year":"2012","unstructured":"Tang, J., Jiang, B., Zheng, A., Luo, B.: Graph matching based on spectral embedding with missing value. PR\u00a045(10), 3768\u20133779 (2012)","journal-title":"PR"},{"issue":"10","key":"1_CR106","first-page":"3208","volume":"43","author":"W. Tao","year":"2010","unstructured":"Tao, W., Chang, F., Liu, L., Jin, H., Wang, T.: Interactively multiphase image segmentation based on variational formulation and graph cuts. PR\u00a043(10), 3208\u20133218 (2010)","journal-title":"PR"},{"issue":"5","key":"1_CR107","first-page":"1393","volume":"40","author":"A. Torsello","year":"2007","unstructured":"Torsello, A., Hancock, E.R.: Graph embedding using tree edit-union. PR\u00a040(5), 1393\u20131405 (2007)","journal-title":"PR"},{"key":"1_CR108","doi-asserted-by":"crossref","unstructured":"Ullmann, J.R.: Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism. J. Exp. Algorithmics\u00a015, 1.6:1.1\u20131.6:1.64 (2011)","DOI":"10.1145\/1671970.1921702"},{"issue":"13","key":"1_CR109","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.neucom.2009.07.015","volume":"73","author":"M. Wan","year":"2009","unstructured":"Wan, M., Lai, Z., Shao, J., Jin, Z.: Two-dimensional local graph embedding discriminant analysis (2dlgeda) with its application to face and palm biometrics. Neurocomputing\u00a073(13), 197\u2013203 (2009)","journal-title":"Neurocomputing"},{"issue":"4","key":"1_CR110","first-page":"1569","volume":"45","author":"B. Wang","year":"2012","unstructured":"Wang, B., Pan, F., Hu, K.M., Paul, J.C.: Manifold-ranking based retrieval using k-regular nearest neighbor graph. PR\u00a045(4), 1569\u20131577 (2012)","journal-title":"PR"},{"issue":"2","key":"1_CR111","first-page":"473","volume":"35","author":"J.T. Wang","year":"2002","unstructured":"Wang, J.T., Zhang, K., Chang, G., Shasha, D.: Finding approximate patterns in undirected acyclic graphs. PR\u00a035(2), 473\u2013483 (2002)","journal-title":"PR"},{"issue":"7","key":"1_CR112","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TPAMI.2005.145","volume":"27","author":"R. Wilson","year":"2005","unstructured":"Wilson, R., Hancock, E., Luo, B.: Pattern vectors from algebraic graph theory. IEEE Trans. on PAMI\u00a027(7), 1112\u20131124 (2005)","journal-title":"IEEE Trans. on PAMI"},{"issue":"9","key":"1_CR113","first-page":"2833","volume":"41","author":"R.C. Wilson","year":"2008","unstructured":"Wilson, R.C., Zhu, P.: A study of graph spectra for comparing graphs and trees. PR\u00a041(9), 2833\u20132841 (2008)","journal-title":"PR"},{"issue":"9","key":"1_CR114","first-page":"2019","volume":"36","author":"B. Wyk van","year":"2003","unstructured":"van Wyk, B., van Wyk, M.: Kronecker product graph matching. PR\u00a036(9), 2019\u20132030 (2003)","journal-title":"PR"},{"issue":"11","key":"1_CR115","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1109\/TPAMI.2004.95","volume":"26","author":"B. Wyk van","year":"2004","unstructured":"van Wyk, B., van Wyk, M.: A pocs-based graph matching algorithm. IEEE Trans. on PAMI\u00a026(11), 1526\u20131530 (2004)","journal-title":"IEEE Trans. on PAMI"},{"issue":"3","key":"1_CR116","first-page":"355","volume":"18","author":"M.A. Wyk van","year":"2004","unstructured":"van Wyk, M.A., van Wyk, B.J.: A learning-based framework for graph matching. IJPRAI\u00a018(3), 355\u2013374 (2004)","journal-title":"IJPRAI"},{"issue":"11","key":"1_CR117","first-page":"2589","volume":"42","author":"B. Xiao","year":"2009","unstructured":"Xiao, B., Hancock, E.R., Wilson, R.C.: Graph characteristics from the heat kernel trace. PR\u00a042(11), 2589\u20132606 (2009)","journal-title":"PR"},{"issue":"12","key":"1_CR118","first-page":"3547","volume":"41","author":"Y. Xiao","year":"2008","unstructured":"Xiao, Y., Dong, H., Wu, W., Xiong, M., Wang, W., Shi, B.: Structure-based graph distance measures of high degree of precision. PR\u00a041(12), 3547\u20133561 (2008)","journal-title":"PR"},{"issue":"3","key":"1_CR119","first-page":"210","volume":"107","author":"N. Xu","year":"2007","unstructured":"Xu, N., Ahuja, N., Bansal, R.: Object segmentation using graph cuts based active contours. CVIU\u00a0107(3), 210\u2013224 (2007)","journal-title":"CVIU"},{"issue":"10","key":"1_CR120","doi-asserted-by":"publisher","first-page":"1814","DOI":"10.1109\/TPAMI.2007.70834","volume":"30","author":"F. Yan","year":"2008","unstructured":"Yan, F., Christmas, W., Kittler, J.: Layered data association using graph-theoretic formulation with application to tennis ball tracking in monocular sequences. IEEE Trans. on PAMI\u00a030(10), 1814\u20131830 (2008)","journal-title":"IEEE Trans. on PAMI"},{"issue":"1","key":"1_CR121","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/TPAMI.2007.250598","volume":"29","author":"S. Yan","year":"2007","unstructured":"Yan, S., Xu, D., Zhang, B., Zhang, H.J., Yang, Q., Lin, S.: Graph embedding and extensions: A general framework for dimensionality reduction. IEEE Trans. on PAMI\u00a029(1), 40\u201351 (2007)","journal-title":"IEEE Trans. on PAMI"},{"issue":"13","key":"1_CR122","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.neucom.2008.09.031","volume":"73","author":"F. Yang","year":"2009","unstructured":"Yang, F., Kruggel, F.: A graph matching approach for labeling brain sulci using location, orientation, and shape. Neurocomputing\u00a073(13), 179\u2013190 (2009)","journal-title":"Neurocomputing"},{"issue":"13","key":"1_CR123","doi-asserted-by":"publisher","first-page":"2015","DOI":"10.1016\/j.patrec.2005.03.021","volume":"26","author":"L. Yang","year":"2005","unstructured":"Yang, L.: Building k-edge-connected neighborhood graph for distance-based data projection. PRL\u00a026(13), 2015\u20132021 (2005)","journal-title":"PRL"},{"issue":"7","key":"1_CR124","first-page":"1283","volume":"22","author":"Q. You","year":"2008","unstructured":"You, Q., Zheng, N., Gao, L., Du, S., Wu, Y.: Analysis of solution for supervised graph embedding. IJPRAI\u00a022(7), 1283\u20131299 (2008)","journal-title":"IJPRAI"},{"key":"1_CR125","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1134\/S1054661810040140","volume":"20","author":"G. Yu","year":"2010","unstructured":"Yu, G., Peng, H., Wei, J., Ma, Q.: Mixture graph based semi-supervised dimensionality reduction. Pattern Recognition and Image Analysis\u00a020, 536\u2013541 (2010)","journal-title":"Pattern Recognition and Image Analysis"},{"key":"1_CR126","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10601-009-9074-3","volume":"15","author":"S. Zampelli","year":"2010","unstructured":"Zampelli, S., Deville, Y., Solnon, C.: Solving subgraph isomorphism problems with constraint programming. Constraints\u00a015, 327\u2013353 (2010)","journal-title":"Constraints"},{"issue":"12","key":"1_CR127","first-page":"3592","volume":"41","author":"H. Zanghi","year":"2008","unstructured":"Zanghi, H., Ambroise, C., Miele, V.: Fast online graph clustering via Erdos-R\u00e9nyi mixture. PR\u00a041(12), 3592\u20133599 (2008)","journal-title":"PR"},{"issue":"9","key":"1_CR128","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1016\/j.patrec.2010.01.026","volume":"31","author":"H. Zanghi","year":"2010","unstructured":"Zanghi, H., Volant, S., Ambroise, C.: Clustering based on random graph model embedding vertex features. PRL\u00a031(9), 830\u2013836 (2010)","journal-title":"PRL"},{"issue":"12","key":"1_CR129","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2008.245","volume":"31","author":"M. Zaslavskiy","year":"2009","unstructured":"Zaslavskiy, M., Bach, F., Vert, J.P.: A path following algorithm for the graph matching problem. IEEE Trans. on PAMI\u00a031(12), 2227\u20132242 (2009)","journal-title":"IEEE Trans. on PAMI"},{"issue":"6","key":"1_CR130","first-page":"2301","volume":"43","author":"C. Zhang","year":"2010","unstructured":"Zhang, C., Wang, F.: A multilevel approach for learning from labeled and unlabeled data on graphs. PR\u00a043(6), 2301\u20132314 (2010)","journal-title":"PR"},{"issue":"11","key":"1_CR131","first-page":"3328","volume":"41","author":"F. Zhang","year":"2008","unstructured":"Zhang, F., Hancock, E.R.: Graph spectral image smoothing using the heat kernel. PR\u00a041(11), 3328\u20133342 (2008)","journal-title":"PR"},{"issue":"7","key":"1_CR132","first-page":"962","volume":"115","author":"H. Zhao","year":"2011","unstructured":"Zhao, H., Robles-Kelly, A., Zhou, J., Lu, J., Yang, J.Y.: Graph attribute embedding via riemannian submersion learning. CVIU\u00a0115(7), 962\u2013975 (2011)","journal-title":"CVIU"},{"issue":"1","key":"1_CR133","first-page":"38","volume":"41","author":"R. Zhi","year":"2011","unstructured":"Zhi, R., Flierl, M., Ruan, Q., Kleijn, W.: Graph-preserving sparse nonnegative matrix factorization with application to facial expression recognition. IEEE Trans. on SMC-B\u00a041(1), 38\u201352 (2011)","journal-title":"IEEE Trans. on SMC-B"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38221-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T21:54:09Z","timestamp":1557698049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38221-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382208","9783642382215"],"references-count":133,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38221-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}