{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:37:22Z","timestamp":1725586642352},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212567"},{"type":"electronic","value":"9783642212574"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21257-4_64","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T02:54:53Z","timestamp":1308365693000},"page":"516-523","source":"Crossref","is-referenced-by-count":1,"title":["A Probabilistic Framework to Obtain a Common Labelling between Attributed 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":[{"key":"64_CR1","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)"},{"issue":"11-13","key":"64_CR2","doi-asserted-by":"publisher","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":"64_CR3","doi-asserted-by":"publisher","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":"64_CR4","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., Escolano, F., Lozano, M.A., Suau, P., Cazorla, M.A., Aguilar, W.: 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":"64_CR5","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":"64_CR6","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.) CIARP 2009. LNCS, vol.\u00a05856, pp. 137\u2013144. Springer, Heidelberg (2009)"},{"key":"64_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness (1979)"},{"key":"64_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/3-540-63507-6_262","volume-title":"Image Analysis and Processing","author":"B.T. Messmer","year":"1997","unstructured":"Messmer, B.T., Bunke, H.: Fast Error-correcting Graph Isomorphism Based on Model Precompilation. In: Del Bimbo, A. (ed.) ICIAP 1997. LNCS, vol.\u00a01310, pp. 693\u2013700. Springer, Heidelberg (1997)"},{"key":"64_CR9","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":"64_CR10","doi-asserted-by":"crossref","unstructured":"Feng, J., Laumy, M., Dhome, M.: Inexact matching using neural networks. In: PR in Practice IV: Multiple Paradigms, Comparative Studies and Hybrid Systems, pp. 177\u2013184 (1994)","DOI":"10.1016\/B978-0-444-81892-8.50020-1"},{"issue":"4","key":"64_CR11","doi-asserted-by":"publisher","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":"64_CR12","doi-asserted-by":"publisher","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"},{"issue":"2","key":"64_CR13","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":"64_CR14","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":"64_CR15","volume-title":"Numerical Methods, section 5.7","author":"G. Dahlquist","year":"1974","unstructured":"Dahlquist, G., Bjrck, K.: Numerical Methods, section 5.7. Prentice-Hall Inc., Englewood Cliffs (1974) ISBN 0-13-627315-7"},{"key":"64_CR16","first-page":"211","volume-title":"Advances in Neural Information Processing Systems","author":"J.S. Bridle","year":"1990","unstructured":"Bridle, J.S.: Training stochastic model recognition algorithms as networks can lead to maximum mutual information estimation of parameters. In: Advances in Neural Information Processing Systems, vol.\u00a02, pp. 211\u2013217. Morgan Kaufmann Publishers Inc., San Francisco (1990)"},{"key":"64_CR17","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)"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21257-4_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T01:10:32Z","timestamp":1553821832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21257-4_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212567","9783642212574"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21257-4_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}