{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:12:57Z","timestamp":1725563577421},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642149795"},{"type":"electronic","value":"9783642149801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14980-1_17","type":"book-chapter","created":{"date-parts":[[2010,8,28]],"date-time":"2010-08-28T10:05:23Z","timestamp":1282989923000},"page":"180-190","source":"Crossref","is-referenced-by-count":11,"title":["Graduated Assignment Algorithm for Finding the Common Labelling of a Set of Graphs"],"prefix":"10.1007","author":[{"given":"Albert","family":"Sol\u00e9-Ribalta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"17_CR1","first-page":"265","volume":"18","author":"D. Conte","year":"2004","unstructured":"Conte, D., et al.: Thirty Years Of Graph Matching In Pattern Recognition. IJPRAI\u00a018(3), 265\u2013298 (2004)","journal-title":"IJPRAI"},{"issue":"11-13","key":"17_CR2","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1016\/S0167-8655(97)00117-7","volume":"18","author":"M.L. Williams","year":"1997","unstructured":"Williams, M.L., Wilson, R.C., Hancock, E.R.: Multiple Graph Matching with Bayesian Inference. PRL\u00a018(11-13), 1275\u20131281 (1997)","journal-title":"PRL"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-02124-4_17","volume-title":"Graph-Based Representations in Pattern Recognition","author":"A. Sol\u00e9-Ribalta","year":"2009","unstructured":"Sol\u00e9-Ribalta, A., Serratosa, F.: A structural and semantic probabilistic model for matching and representing a set of graphs. In: Torsello, A., Escolano, F., Brun, L. (eds.) GbRPR 2009. LNCS, vol.\u00a05534, pp. 164\u2013173. Springer, Heidelberg (2009)"},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/TPAMI.1985.4767707","volume":"7","author":"A.K.C. Wong","year":"1985","unstructured":"Wong, A.K.C., et al.: Entropy and distance of random graphs with application to structural pattern recognition. IEEE TPAMI\u00a07, 599\u2013609 (1985)","journal-title":"IEEE TPAMI"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-72903-7_31","volume-title":"Graph-Based Representations in Pattern Recognition","author":"B. Bonev","year":"2007","unstructured":"Bonev, B., et al.: Constellations and the unsupervised learning of graphs. In: Escolano, F., Vento, M. (eds.) GbRPR. LNCS, vol.\u00a04538, pp. 340\u2013350. Springer, Heidelberg (2007)"},{"issue":"6","key":"17_CR6","first-page":"621","volume":"16","author":"F. Serratosa","year":"2002","unstructured":"Serratosa, F., et al.: Synthesis of function-described graphs and clustering of attributed graph. IJPRAI\u00a016(6), 621\u2013655 (2002)","journal-title":"IJPRAI"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-10268-4_16","volume-title":"Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications","author":"A. Sol\u00e9-Ribalta","year":"2009","unstructured":"Sol\u00e9-Ribalta, A., Serratosa, F.: On the Computation of the Common Labelling of a set of Attributed Graphs. In: Bayro-Corrochano, E., Eklundh, J.-O. (eds.) Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. LNCS, vol.\u00a05856, pp. 137\u2013144. Springer, Heidelberg (2009)"},{"issue":"4","key":"17_CR8","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE TPAMI\u00a018(4), 377\u2013388 (1996)","journal-title":"IEEE TPAMI"},{"issue":"8","key":"17_CR9","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1109\/34.400565","volume":"17","author":"W.J. Christmas","year":"1995","unstructured":"Christmas, W.J., Kittler, J., Petrou, M.: Structural matching in computer vision using probabilistic relaxation. IEEE TPAMI\u00a017(8), 749\u2013764 (1995)","journal-title":"IEEE TPAMI"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1109\/TSMC.1976.4309519","volume":"6","author":"A. Rosenfeld","year":"1976","unstructured":"Rosenfeld, A., Hummel, R.A., Zucker, S.W.: Scene labeling by relaxation operators. IEEE Transactions on Systems, Man and Cybernetics\u00a06, 420\u2013443 (1976)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1109\/TSMC.1983.6313149","volume":"13","author":"D.P. O\u2019leary","year":"1983","unstructured":"O\u2019leary, D.P., Peleg, S.: Analysis of relaxation processes: The two-node label case. IEEE Transactions on Systems, Man and Cybernetics\u00a013, 618\u2013623 (1983)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1214\/aoms\/1177703591","volume":"35","author":"R. Sinkhorn","year":"1964","unstructured":"Sinkhorn, R.: A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices. The Annals of Mathematical Statistics\u00a035(2), 876\u2013879 (1964)","journal-title":"The Annals of Mathematical Statistics"},{"issue":"1-2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem Export. Naval Research Logistics Quarterly\u00a02(1-2), 83\u201397 (1955)","journal-title":"Naval Research Logistics Quarterly"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-89689-0_33","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"K. Riesen","year":"2008","unstructured":"Riesen, K., Bunke, H.: IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) S+SSPR 2008. LNCS, vol.\u00a05342, pp. 287\u2013297. Springer, Heidelberg (2008)"},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A. Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.S.: A Distance Measure Between Attributed Relational Graphs for Pattern Recognition. Trans. Systems, Man, and Cybernetics\u00a013, 353\u2013362 (1983)","journal-title":"Trans. Systems, Man, and Cybernetics"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14980-1_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:42:23Z","timestamp":1619786543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14980-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642149795","9783642149801"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14980-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}