{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T16:49:49Z","timestamp":1774716589615,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/bigdata.2018.8622566","type":"proceedings-article","created":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T03:07:18Z","timestamp":1548385638000},"page":"3980-3985","source":"Crossref","is-referenced-by-count":28,"title":["Filtering Methods for Subgraph Matching on Multiplex Networks"],"prefix":"10.1109","author":[{"given":"Jacob D.","family":"Moorman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinyi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas K.","family":"Tu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zachary M.","family":"Boyd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea L.","family":"Bertozzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23219-5_21"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58961-9_12"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448946"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0304-0208(08)73101-3","article-title":"A local-ratio theorem for approximating the weighted vertex cover problem","author":"bar-yehuda","year":"1985","journal-title":"Analysis and Design of Algorithms for Combinatorial Problems"},{"key":"ref14","first-page":"362","article-title":"A filtering algorithm for constraints of difference in CSPs","volume":"1","author":"r\u00e9gin","year":"1994","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1005283"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/s41559-017-0101"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref5","author":"schwartz","year":"2018","journal-title":"Modeling Adversarial Activity (MAA)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.05.002"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/sf\/57.4.1286"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnu016"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-319-10428-7_12","article-title":"Scoring-based neighborhood dominance for the subgraph isomorphism problem","author":"audemard","year":"2014","journal-title":"3 Internat Conf on Principles and Practice of Constraint Programming"}],"event":{"name":"2018 IEEE International Conference on Big Data (Big Data)","location":"Seattle, WA, USA","start":{"date-parts":[[2018,12,10]]},"end":{"date-parts":[[2018,12,13]]}},"container-title":["2018 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8610059\/8621858\/08622566.pdf?arnumber=8622566","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T23:29:22Z","timestamp":1643239762000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8622566\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2018.8622566","relation":{},"subject":[],"published":{"date-parts":[[2018,12]]}}}