{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:05Z","timestamp":1725574085814},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261544"},{"type":"electronic","value":"9783540322382"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11492542_17","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:04:07Z","timestamp":1294455847000},"page":"131-138","source":"Crossref","is-referenced-by-count":0,"title":["Matching Attributed Graphs: 2nd-Order Probabilities for Pruning the Search Tree"],"prefix":"10.1007","author":[{"given":"Francesc","family":"Serratosa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Sanfeliu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1142\/S0218001404003253","volume":"18","author":"Sanfeliu","year":"2004","unstructured":"Sanfeliu, Serratosa, F., Alqu\u00e9zar, R.: Second-Order Random Graphs for modeling sets of Attributed Graphs and their application to object learning and recognition. International Journal of Pattern Recognition and Artificial Intelligence\u00a018(3), 375\u2013396 (2004)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1007\/978-3-540-27868-9_125","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"F. Serratosa","year":"2004","unstructured":"Serratosa, F., Sanfeliu, A.: Distance measures between Attributed Graphs and Secondorder Random Graphs. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR&SPR 2004. LNCS, vol.\u00a03138, pp. 1135\u20131144. Springer, Heidelberg (2004)"},{"issue":"6","key":"17_CR3","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1142\/S0218001402001915","volume":"16","author":"F. Serratosa","year":"2002","unstructured":"Serratosa, F., Alqu\u00e9zar, R., Sanfeliu, A.: Synthesis of function-described graphs and clustering of attributed graphs. Int. Journ. of Pattern Recognition and Artificial Intelligence\u00a016(6), 621\u2013655 (2002)","journal-title":"Int. Journ. of Pattern Recognition and Artificial Intelligence"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1016\/S0031-3203(02)00107-3","volume":"36","author":"F. Serratosa","year":"2003","unstructured":"Serratosa, F., Alqu\u00e9zar, R., Sanfeliu, A.: Function-Described Graphs for modeling objects represented by attributed graphs. Pattern Recognition\u00a036(3), 781\u2013798 (2003)","journal-title":"Pattern Recognition"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1109\/34.385984","volume":"17","author":"K. Sengupta","year":"1995","unstructured":"Sengupta, K., Boyer, K.: Organizing large structural modelbases. PAMI\u00a017, 321\u2013332 (1995)","journal-title":"PAMI"},{"key":"17_CR6","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., You, M.: Entropy and distance of random graphs with application to structural pattern recognition. IEEE PAMI\u00a07, 599\u2013609 (1985)","journal-title":"IEEE PAMI"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0033223","volume-title":"Advances in Pattern Recognition","author":"H. Bunke","year":"1998","unstructured":"Bunke, H.: Error-tolerant graph matching: a formal framework and algorithms. In: Amin, A., Pudil, P., Dori, D. (eds.) SPR 1998 and SSPR 1998. LNCS, vol.\u00a01451, pp. 1\u201314. Springer, Heidelberg (1998)"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/21.57275","volume":"20","author":"A.K.C. Wong","year":"1990","unstructured":"Wong, A.K.C., You, M., Chan, S.C.: An algorithm for graph optimal monomorphism. IEEE Trans. on Systems, Man and Cyber\u00a020, 628\u2013636 (1990)","journal-title":"IEEE Trans. on Systems, Man and Cyber"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1109\/TSMC.1978.4310019","volume":"8","author":"S. Peleg","year":"1978","unstructured":"Peleg, S., Rosenfeld, A.: Determining compatibility coefficients for curve enchancement relaxation processes. IEEE Transactions on Systems, Man and Cybernetics\u00a08, 548\u2013555 (1978)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11492542_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:37:34Z","timestamp":1619505454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11492542_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261544","9783540322382"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11492542_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}