{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:42:49Z","timestamp":1725619369641},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3323165.3323170","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"343-344","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Parallel Algorithm for Subgraph Isomorphism (Brief Announcement)"],"prefix":"10.1145","author":[{"given":"Rohan","family":"Yadav","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Umut A.","family":"Acar","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442538"},{"key":"e_1_3_2_1_2_1","first-page":"25","volume-title":"Theory and Practice of Chunked Sequences","author":"Acar Umut A.","year":"2014","unstructured":"Umut A. Acar , Arthur Chargu\u00e9raud , and Mike Rainey . Theory and Practice of Chunked Sequences , pages 25 -- 36 . Springer Berlin Heidelberg , Berlin, Heidelberg , 2014 . Umut A. Acar, Arthur Chargu\u00e9raud, and Mike Rainey. Theory and Practice of Chunked Sequences, pages 25--36. Springer Berlin Heidelberg, Berlin, Heidelberg, 2014."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"e_1_3_2_1_4_1","volume-title":"Parallel subgraph isomorphism","author":"Blankstein Aaron","year":"2010","unstructured":"Aaron Blankstein and Matthew Goldstein . Parallel subgraph isomorphism , 2010 . Unpublished Manuscript . Aaron Blankstein and Matthew Goldstein. Parallel subgraph isomorphism, 2010. Unpublished Manuscript."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23219-5_21"},{"key":"e_1_3_2_1_6_1","volume-title":"A database of graphs for isomorphism and sub-graph isomorphism benchmarking","author":"Foggia P.","year":"2001","unstructured":"P. Foggia , C. Sansone , and M. Vento . A database of graphs for isomorphism and sub-graph isomorphism benchmarking . 2001 . P. Foggia, C. Sansone, and M. Vento. A database of graphs for isomorphism and sub-graph isomorphism benchmarking. 2001."},{"key":"e_1_3_2_1_7_1","volume-title":"Wah Guo-Jie Li. How to cope with anomalies in parallel approximate branch-and-bound algorithms","author":"Benjamin","year":"1984","unstructured":"Benjamin W. Wah Guo-Jie Li. How to cope with anomalies in parallel approximate branch-and-bound algorithms . 1984 . Benjamin W. Wah Guo-Jie Li. How to cope with anomalies in parallel approximate branch-and-bound algorithms. 1984."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.05.002"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_1_12_1","first-page":"128","volume-title":"Introducing vf3: A new algorithm for subgraph isomorphism","author":"Vincenzo Carletti","year":"2017","unstructured":"Carletti Vincenzo , Pasquale Foggia , Alessia Saggese , and Mario Vento . Introducing vf3: A new algorithm for subgraph isomorphism . pages 128 -- 139 , 05 2017 . Carletti Vincenzo, Pasquale Foggia, Alessia Saggese, and Mario Vento. Introducing vf3: A new algorithm for subgraph isomorphism. pages 128--139, 052017."}],"event":{"name":"SPAA '19: 31st ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Phoenix AZ USA","acronym":"SPAA '19"},"container-title":["The 31st ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323165.3323170","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T17:29:26Z","timestamp":1673458166000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":12,"alternative-id":["10.1145\/3323165.3323170","10.1145\/3323165"],"URL":"https:\/\/doi.org\/10.1145\/3323165.3323170","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}