{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T04:47:59Z","timestamp":1777178879039,"version":"3.51.4"},"reference-count":63,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T00:00:00Z","timestamp":1727049600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T00:00:00Z","timestamp":1727049600000},"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":[[2024,9,23]]},"DOI":"10.1109\/hpec62836.2024.10938454","type":"proceedings-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T19:07:19Z","timestamp":1743707239000},"page":"1-9","source":"Crossref","is-referenced-by-count":6,"title":["VF2-PS: Parallel and Scalable Subgraph Monomorphism in Arachne"],"prefix":"10.1109","author":[{"given":"Mohammad","family":"Dindoost","sequence":"first","affiliation":[{"name":"New Jersey Institute of Technology,Department of Data Science,Newark,NJ,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver Alvarado","family":"Rodriguez","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology,Department of Data Science,Newark,NJ,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sounak","family":"Bagchi","sequence":"additional","affiliation":[{"name":"Edison Academy Magnet School,Edison,NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Palina","family":"Pauliuchenka","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology,Department of Data Science,Newark,NJ,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihui","family":"Du","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology,Department of Data Science,Newark,NJ,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David A.","family":"Bader","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology,Department of Data Science,Newark,NJ,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"143","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"2023","journal-title":"Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1177\/1094342007078442"},{"key":"ref4","article-title":"Chapel comes of age: Making scalable programming productive","author":"Chamberlain","year":"2018","journal-title":"Cray User Group"},{"issue":"1","key":"ref5","doi-asserted-by":"crossref","first-page":"13045","DOI":"10.1038\/s41598-021-91025-5","article-title":"DotMotif: an opensource tool for connectome subgraph isomorphism search and graph queries","volume":"11","author":"Matelsky","year":"2021","journal-title":"Scientific Reports"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC55821.2022.9991947"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3329722.3330148"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW50202.2020.00109"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC55821.2022.9991947"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3390\/a14080221"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC58863.2023.10363498"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC58850.2023.00022"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/hipc56025.2022.00026"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC55821.2022.9991947"},{"key":"ref15","article-title":"Exploratory large scale graph analytics in arkouda","author":"Du","year":"2021","journal-title":"8th Annual Chapel Implementers and Users Workshop (CHIUW 2021)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2006.55"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41190-8_44"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1142\/s0218001404003228"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1142\/s0218001414500013"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.31887\/DCNS.2013.15.3\/osporns"},{"issue":"5594","key":"ref21","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1126\/science.298.5594.824","article-title":"Network motifs: simple building blocks of complex networks","volume":"298","author":"Milo","year":"2002","journal-title":"Science"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2424894"},{"key":"ref23","author":"Fortin","year":"1996","journal-title":"The Graph Isomorphism Problem"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1177\/1473871616666393"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3232-6"},{"issue":"3","key":"ref26","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","article-title":"A review on algorithms for maximum clique problems","volume":"242","author":"Wu","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"ref27","author":"Garey","year":"1990","journal-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-09438-9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18224-7_17"},{"issue":"290-297","key":"ref30","first-page":"18","article-title":"On random graphs i","volume":"6","author":"Erdos","year":"1959","journal-title":"Publ. math. debrecen"},{"issue":"6684","key":"ref31","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u2019smallworld\u2019networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"ref33","first-page":"2020","article-title":"A connectome of the adult drosophila central brain","author":"Xu","year":"2020","journal-title":"BioRxiv"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1352-7"},{"issue":"1165","key":"ref35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1098\/rstb.1986.0056","article-title":"The structure of the nervous system of the nematode caenorhabditis elegans","volume":"314","author":"White","year":"1986","journal-title":"Philos Trans R Soc Lond B Biol Sci"},{"issue":"6093","key":"ref36","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1126\/science.1221762","article-title":"The connectome of a decision-making neural network","volume":"337","author":"Jarrell","year":"2012","journal-title":"Science"},{"key":"ref37","first-page":"601","article-title":"Motifs in temporal networks","volume-title":"Proceedings of the tenth ACM international conference on web search and data mining","author":"Paranjape"},{"key":"ref38","first-page":"141","article-title":"A parallel algorithm for subgraph isomorphism","volume-title":"Graph-Based Representations in Pattern Recognition: 12th IAPR-TC-15 International Workshop, GbRPR 2019, Tours, France, June 19\u201321, 2019, Proceedings 12","author":"Carletti"},{"issue":"3","key":"ref39","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0255(79)90023-9","article-title":"Relational consistency algorithms and their application in finding subgraph and graph isomorphisms","volume":"19","author":"McGregor","year":"1979","journal-title":"Information Sciences"},{"key":"ref40","first-page":"1","article-title":"Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism","volume":"15","author":"Ullmann","year":"2011","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"issue":"1","key":"ref41","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","article-title":"An algorithm for subgraph isomorphism","volume":"23","author":"Ullmann","year":"1976","journal-title":"Journal of the ACM (JACM)"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.dam.2018.02.018","article-title":"VF2++\u2014An improved subgraph isomorphism algorithm","volume":"242","author":"J\u00fcttner","year":"2018","journal-title":"Discrete Applied Mathematics"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2696940"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-97785-0_30"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"issue":"1-2","key":"ref46","first-page":"340","article-title":"On graph query optimization in large networks","volume-title":"Proceedings of the VLDB Endowment","volume":"3","author":"Zhao"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735493"},{"key":"ref48","first-page":"1199","article-title":"Efficient subgraph matching by postponing cartesian products","volume-title":"Proceedings of the 2016 International Conference on Management of Data","author":"Bi"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300086"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448946"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2875262"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-20081-7_1"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380581"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/2621934.2621939"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056445"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-19212-9_2"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23219-5_21"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18120-2_18"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3589326"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389699"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3230744"},{"key":"ref63","volume-title":"NetworkX: Network analysis with Python","author":"Hagberg","year":"2020"}],"event":{"name":"2024 IEEE High Performance Extreme Computing Conference (HPEC)","location":"Wakefield, MA, USA","start":{"date-parts":[[2024,9,23]]},"end":{"date-parts":[[2024,9,27]]}},"container-title":["2024 IEEE High Performance Extreme Computing Conference (HPEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10938401\/10938415\/10938454.pdf?arnumber=10938454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T17:30:53Z","timestamp":1743787853000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10938454\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,23]]},"references-count":63,"URL":"https:\/\/doi.org\/10.1109\/hpec62836.2024.10938454","relation":{},"subject":[],"published":{"date-parts":[[2024,9,23]]}}}