{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T21:12:20Z","timestamp":1771189940136,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540729020","type":"print"},{"value":"9783540729037","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72903-7_32","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T02:54:03Z","timestamp":1187578443000},"page":"351-360","source":"Crossref","is-referenced-by-count":4,"title":["On the Relation Between the Median and the Maximum Common Subgraph of a Set of Graphs"],"prefix":"10.1007","author":[{"given":"Miquel","family":"Ferrer","sequence":"first","affiliation":[]},{"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[]},{"given":"Ernest","family":"Valveny","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/TPAMI.1985.4767707","volume":"7","author":"A. Wong","year":"1985","unstructured":"Wong, A., You, M.: Entropy and distance of random graphs with application to structural pattern recognition. T-PAMI\u00a07, 599\u2013609 (1985)","journal-title":"T-PAMI"},{"issue":"3","key":"32_CR2","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 modelling objects represented by sets of attributed graphs. Pattern Recognition\u00a036(3), 781\u2013798 (2003)","journal-title":"Pattern Recognition"},{"issue":"3","key":"32_CR3","first-page":"375","volume":"18","author":"A. Sanfeliu","year":"2004","unstructured":"Sanfeliu, A., Serratosa, F., Alqu\u00e9zar, 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":"5","key":"32_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1109\/34.682179","volume":"20","author":"B.T. Messmer","year":"1998","unstructured":"Messmer, B.T., Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. Pattern Anal. Mach. Intell.\u00a020(5), 493\u2013504 (1998)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"10","key":"32_CR5","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1109\/34.954604","volume":"23","author":"X. Jiang","year":"2001","unstructured":"Jiang, X., M\u00fcnger, A., Bunke, H.: On median graphs: Properties, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell.\u00a023(10), 1144\u20131151 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"8","key":"32_CR6","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H. Bunke","year":"1997","unstructured":"Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters\u00a018(8), 689\u2013694 (1997)","journal-title":"Pattern Recognition Letters"},{"issue":"4","key":"32_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0167-8655(83)90033-8","volume":"1","author":"H. Bunke","year":"1983","unstructured":"Bunke, H., Allerman, G.: Inexact graph matching for structural pattern recognition. Pattern Recognition Letters\u00a01(4), 245\u2013253 (1983)","journal-title":"Pattern Recognition Letters"},{"issue":"11-13","key":"32_CR8","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1016\/S0167-8655(99)00094-X","volume":"20","author":"H. Bunke","year":"1999","unstructured":"Bunke, H., M\u00fcnger, A., Jiang, X.: Combinatorial search versus genetic algorithms: A case study based on the generalized median graph problem. Pattern Recognition Letters\u00a020(11-13), 1271\u20131277 (1999)","journal-title":"Pattern Recognition Letters"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72903-7_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:50:15Z","timestamp":1619517015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72903-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729020","9783540729037"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72903-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}