{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T00:33:19Z","timestamp":1787013199142,"version":"build-2736575974"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2022,1,1]]},"DOI":"10.1109\/tkde.2020.2980257","type":"journal-article","created":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T16:27:36Z","timestamp":1584116856000},"page":"491-505","source":"Crossref","is-referenced-by-count":38,"title":["Subgraph Matching With Effective Matching Order and Indexing"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4060-9438","authenticated-orcid":false,"given":"Shixuan","family":"Sun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4275-1756","authenticated-orcid":false,"given":"Qiong","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544814"},{"key":"ref2","article-title":"An O (m) algorithm for cores decomposition of networks","author":"Batagelj","year":"2003"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"ref6","volume-title":"Computers and Intractability: A Guide to the Theory of np-Completeness","author":"Garey","year":"1979"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71681-5_7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032862"},{"key":"ref9","first-page":"337","article-title":"Turboiso: Towards ultrafast and robust subgraph isomorphism search in large graph databases","volume-title":"Proc. ACM SIGMOD Int. Conf. Manage. Data","author":"Han"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.37"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1971.1"},{"key":"ref13","first-page":"25","article-title":"Subgraph querying with parallel use of query rewritings and alternative algorithms","volume-title":"Proc. Int. Conf. Extending Database Technol.","author":"Katsarou"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915209"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2017.133"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794368"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021937"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448946"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/3149193.3149198"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735493"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021929"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-x"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588557"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref27","volume-title":"Introduction to Graph Theory","author":"West","year":"2001"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920887"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/9639435\/09035407.pdf?arnumber=9035407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T17:19:17Z","timestamp":1704820757000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9035407\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,1]]},"references-count":28,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2020.2980257","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,1]]}}}