{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:36:51Z","timestamp":1758267411614,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/icpr.2004.1334549","type":"proceedings-article","created":{"date-parts":[[2004,11,8]],"date-time":"2004-11-08T16:27:50Z","timestamp":1099931270000},"page":"394-397 Vol.3","source":"Crossref","is-referenced-by-count":18,"title":["Graph matching using random walks"],"prefix":"10.1109","author":[{"given":"M.","family":"Gori","sequence":"first","affiliation":[{"name":"DII, Univ. degli Studi di Siena, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Maggini","sequence":"additional","affiliation":[{"name":"DII, Univ. degli Studi di Siena, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Sarti","sequence":"additional","affiliation":[{"name":"DII, Univ. degli Studi di Siena, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ICIAP.1999.797762"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/34.400565"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1142\/S0219467802000603"},{"key":"6","first-page":"124","article-title":"Using genetic algorithm to solve npcomplete problems","author":"de jong","year":"1989","journal-title":"Genetic Algorithms"},{"key":"5","article-title":"A performance comparison of five algorithms for graph isomorphism","author":"foggia","year":"2001","journal-title":"Proceedings of the 3rd IAPR TC-15 International Workshop on Graph-based Representation"},{"key":"4","article-title":"A database of graphs for isomorphism and sub-graph isomorphism benchmarking","author":"foggia","year":"2001","journal-title":"Proceedings of the 3rd IAPR TC-15 International Workshop on Graph-based Representation"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321963"},{"key":"8","first-page":"45","article-title":"Practical graph isomorphism","volume":"30","author":"mckay","year":"1981","journal-title":"Congressus Numerantium"}],"event":{"name":"Proceedings of the 17th International Conference on Pattern Recognition","start":{"date-parts":[[2004,8,26]]},"location":"Cambridge, UK","end":{"date-parts":[[2004,8,26]]}},"container-title":["Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9258\/29387\/01334549.pdf?arnumber=1334549","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T18:27:06Z","timestamp":1707503226000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1334549\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/icpr.2004.1334549","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}