{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T05:29:16Z","timestamp":1734499756437,"version":"3.30.2"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icip.2003.1246607","type":"proceedings-article","created":{"date-parts":[[2004,6,3]],"date-time":"2004-06-03T20:14:56Z","timestamp":1086293696000},"page":"II-25-8","source":"Crossref","is-referenced-by-count":2,"title":["Weighted minimum common supergraph for cluster representation"],"prefix":"10.1109","volume":"3","author":[{"given":"H.","family":"Bunke","sequence":"first","affiliation":[]},{"given":"G.","family":"Guidobaldi","sequence":"additional","affiliation":[]},{"given":"M.","family":"Vento","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/PL00021410","article-title":"On the Minimum Common Supergraph of two Graphs","volume":"65","year":"2000","journal-title":"Computing"},{"key":"ref3","first-page":"109","article-title":"Benchmarking of Graph Matching Algorithms","author":"bunke","year":"1999","journal-title":"Proc 2ndGbR Haindorf"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380120103"},{"article-title":"Pattern Classification","year":"2000","author":"duda","key":"ref6"},{"key":"ref11","first-page":"259","article-title":"Face recognition: Graph matching versus neural techniques","volume":"i","author":"verges-lahi","year":"1999","journal-title":"NSPRIA'99"},{"key":"ref5","first-page":"250","article-title":"Similarity Learning for Graph-Based Image Representations","author":"de mauro","year":"2001","journal-title":"Proc of the 3rd IAPR-TC15 GbR"},{"key":"ref12","first-page":"197","article-title":"Random Graphs, in Syntactic and Structural Pattern Recognition - Theory and Applications","volume":"4","author":"wong","year":"1990"},{"key":"ref8","first-page":"176","article-title":"A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking","author":"foggia","year":"2001","journal-title":"3rd IAPR TC-15 GbR"},{"key":"ref7","first-page":"401","article-title":"Self-organizing Map for Clustering in the Graph Domain","volume":"23","author":"g\u00fcnter","year":"0","journal-title":"PRLe"},{"key":"ref2","first-page":"123","article-title":"A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs SSPR\/SPR2002","author":"bunke","year":"2002"},{"key":"ref9","first-page":"83","article-title":"Spectral Feature vectors for Graph Clustering","author":"luo","year":"2002","journal-title":"SSPR\/SPR"},{"key":"ref1","first-page":"115","article-title":"Graph-based Representation in Different Application Domains","author":"brun","year":"2001","journal-title":"3rd IAPR TC-15 GbR"}],"event":{"name":"International Conference on Image Processing","acronym":"ICIP-03","location":"Barcelona, Spain"},"container-title":["Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8824\/27931\/01246607.pdf?arnumber=1246607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T10:03:37Z","timestamp":1734429817000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1246607\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/icip.2003.1246607","relation":{},"subject":[]}}