{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:30:01Z","timestamp":1768282201866,"version":"3.49.0"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2 027 277"],"award-info":[{"award-number":["DMS-2 027 277"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DGE-1 829 071"],"award-info":[{"award-number":["DGE-1 829 071"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-18-2-0066"],"award-info":[{"award-number":["FA8750-18-2-0066"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2021,4,1]]},"DOI":"10.1109\/tnse.2021.3056329","type":"journal-article","created":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T23:00:54Z","timestamp":1612393254000},"page":"1367-1384","source":"Crossref","is-referenced-by-count":15,"title":["Subgraph Matching on Multiplex Networks"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4291-1561","authenticated-orcid":false,"given":"Jacob D.","family":"Moorman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5539-6271","authenticated-orcid":false,"given":"Thomas K.","family":"Tu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2912-2728","authenticated-orcid":false,"given":"Qinyi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4136-9408","authenticated-orcid":false,"given":"Xie","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0396-7391","authenticated-orcid":false,"given":"Andrea L.","family":"Bertozzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.14778\/2002974.2002976"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx252"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920887"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516384"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23219-5_21"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2011.114"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9006047"},{"key":"ref32","first-page":"187","article-title":"Dancing links. millennial perspectives in computer science","author":"knuth","year":"2000","journal-title":"Millennial Perspectives in Computer Science"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnu016"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622199"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622100"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2424894"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129501003577"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50349-3_8"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref62","year":"2015","journal-title":"United Kingdom's National Public Transport Data Repository"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/1671970.1921702"},{"key":"ref63","article-title":"The alldifferent constraint: A survey","author":"hoeve","year":"2001","journal-title":"6th Annu Workshop ERCIM Working Group Constraints"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44403-1_24"},{"key":"ref64","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.2307\/2577271","article-title":"Multiplexity in adult friendships","volume":"57","author":"verbrugge","year":"1979","journal-title":"Social Forces"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3160595"},{"key":"ref66","first-page":"721","article-title":"gSpan: Graph-based substructure pattern mining","author":"yan","year":"2002","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.02.018"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512952"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-009-9074-3"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.245"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"241i","DOI":"10.1093\/bioinformatics\/btn163","article-title":"Biomolecular network motif counting and discovery by color coding","volume":"24","author":"alon","year":"2008","journal-title":"Bioinformatics"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.141"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1038\/sdata.2014.56"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.10.006"},{"key":"ref21","article-title":"Computers and intractability: A guide to the theory of NP-Completeness","author":"garey","year":"1979"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"key":"ref23","first-page":"337","article-title":"Turbo ISO: Towards ultrafast and robust subgraph isomorphism search in large graph databases","author":"han","year":"2013","journal-title":"Proc ACM SIGMOD Int Conf Manage Data"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"ref25","article-title":"Interactive template map","author":"he","year":"2019"},{"key":"ref50","first-page":"362","article-title":"A filtering algorithm for constraints of difference in CSPs","author":"r\u00e9gin","year":"0","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735493"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2914651"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00028"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.05.002"},{"key":"ref55","first-page":"13","article-title":"Sudoku as a constraint problem","author":"simonis","year":"2005","journal-title":"Proc 4th Int Workshop Modelling Reformulating Constraint Satisfaction Problems"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_54"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2017.85"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2696940"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18224-7_17"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1613\/jair.5768"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12079-4_43"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2003.1246606"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622305"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1038\/srep02980"},{"key":"ref17","article-title":"Metrics for evaluating network alignment","author":"douglas","year":"2018","journal-title":"Proc of ACM Int Conf on Web Search and Data Mining"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.51"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2274576.2274578"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)73101-3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622601"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1005283"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1038\/srep01344"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-S7-S13"},{"key":"ref49","year":"2005"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58961-9_12"},{"key":"ref46","author":"norvig","year":"2010"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9006538"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1038\/s41559-017-0101"},{"key":"ref47","author":"norvig","year":"2017"},{"key":"ref42","article-title":"MultiRI: Fast subgraph matching in labeled multigraphs","author":"micale","year":"2020"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(79)90023-9"},{"key":"ref44","article-title":"Compact neighborhood index for subgraph queries in massive graphs","author":"nabti","year":"2018"},{"key":"ref43","author":"moorman","year":"2020"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6488902\/9475902\/9346051-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488902\/9475902\/09346051.pdf?arnumber=9346051","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:53:32Z","timestamp":1652194412000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9346051\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,1]]},"references-count":73,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2021.3056329","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"value":"2327-4697","type":"electronic"},{"value":"2334-329X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,1]]}}}