{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T02:22:48Z","timestamp":1730254968115,"version":"3.28.0"},"reference-count":18,"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.1334546","type":"proceedings-article","created":{"date-parts":[[2004,11,8]],"date-time":"2004-11-08T16:27:50Z","timestamp":1099931270000},"page":"379-382 Vol.3","source":"Crossref","is-referenced-by-count":1,"title":["Structural graph matching with polynomial bounds on memory and on worst-case effort"],"prefix":"10.1109","author":[{"given":"F.W.","family":"DePiero","sequence":"first","affiliation":[{"name":"CalPoly State Univ., San Luis Obispo, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","article-title":"Time Bounds for Selection","volume":"stan cs 73 349","author":"tarjan","year":"1973","journal-title":"Tech Report"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1265866"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/34.601251"},{"key":"16","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190010410","article-title":"The graph isomorphism disease","volume":"1","author":"read","year":"1977","journal-title":"Journal of Graph Theory"},{"journal-title":"Graphical Evolution An Introduction to the Theory of Random Graphs","year":"1985","author":"palmer","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"11","first-page":"45","article-title":"Practical graph isomorphism","volume":"30","author":"mckay","year":"1981","journal-title":"Congressus Numerantium"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/34.862201"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/34.730557"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/0262-8856(96)01093-1"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1251153"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/34.682179"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"},{"key":"6","article-title":"Home page","author":"depiero","year":"2004","journal-title":"Software for Graph Matching"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(02)00186-1"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.5244\/C.17.61"},{"key":"9","first-page":"1106","article-title":"Structural graph matching using the EM algorithm and singular value decomposition","volume":"23","author":"luo","year":"2001","journal-title":"IEEE Trans PAMI"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1142\/S021800148900005X"}],"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\/01334546.pdf?arnumber=1334546","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T18:27:07Z","timestamp":1707503227000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1334546\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/icpr.2004.1334546","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}