{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T07:54:37Z","timestamp":1776930877127,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,11,15]],"date-time":"2026-11-15T00:00:00Z","timestamp":1794700800000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["1955367"],"award-info":[{"award-number":["1955367"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,16]]},"DOI":"10.1145\/3712285.3759839","type":"proceedings-article","created":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T16:05:39Z","timestamp":1762963539000},"page":"1510-1523","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fringe-SGC: Counting Subgraphs with Fringe Vertices"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-2137-0999","authenticated-orcid":false,"given":"Cameron","family":"Bradley","sequence":"first","affiliation":[{"name":"Texas State University, San Marcos, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5522-9441","authenticated-orcid":false,"given":"Ghadeer","family":"Ahmed H Alabandi","sequence":"additional","affiliation":[{"name":"Texas State University, San Marcos, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7717-3354","authenticated-orcid":false,"given":"Martin","family":"Burtscher","sequence":"additional","affiliation":[{"name":"Texas State University, San Marcos, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,11,15]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-91560-536"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3320219"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447818.3460359"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","unstructured":"Xuhao Chen Roshan Dathathri Gurbinder Gill and Keshav Pingali. 2020. Pangolin: an efficient and flexible graph mining system on CPU and GPU. Proc. VLDB Endow. 13 8 (April 2020) 1190\u20131205. 10.14778\/3389133.3389137","DOI":"10.14778\/3389133.3389137"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA52012.2021.00052"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","unstructured":"Sutanay Choudhury Lawrence Holder George Chin Khushbu Agarwal and John Feo. 2015. A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs. 10.5441\/002\/edbt.2015.15","DOI":"10.5441\/002\/edbt.2015.15"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","unstructured":"M. Deshpande M. Kuramochi N. Wale and G. Karypis. 2005. Frequent substructure-based approaches for classifying chemical compounds. IEEE Transactions on Knowledge and Data Engineering 17 8 (2005) 1036\u20131050. 10.1109\/TKDE.2005.127","DOI":"10.1109\/TKDE.2005.127"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","unstructured":"Katherine Faust. 2010. A puzzle concerning triads in social networks: Graph constraints and the triad census. Social Networks 32 3 (2010) 221\u2013233. 10.1016\/j.socnet.2010.03.004","DOI":"10.1016\/j.socnet.2010.03.004"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","unstructured":"M\u00e1t\u00e9 Fellner B\u00e1lint Varga and Vince Grolmusz. 2019. The frequent subgraphs of the connectome of the human brain. Cognitive Neurodynamics 13 5 (May 2019) 453\u2013460. 10.1007\/s11571-019-09535-y","DOI":"10.1007\/s11571-019-09535-y"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","unstructured":"Chuntao Jiang Frans Coenen and Michele Zito. 2013. A survey of frequent subgraph mining algorithms. The Knowledge Engineering Review 28 1 (2013) 75\u2013105. 10.1017\/S0269888912000331","DOI":"10.1017\/S0269888912000331"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/IKT51791.2020.9345622"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/PACT52795.2021.00028"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359633"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","unstructured":"Tijana Milenkovi\u0107 and Natasa Przulj. 2008. Uncovering biological network function via graphlet degree signatures. Cancer Inform 6 (2008) 257\u2013273. 10.4137\/CIN.S680","DOI":"10.4137\/CIN.S680"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","unstructured":"Phuong\u00a0Dao Noga\u00a0Alon Fereydoun\u00a0Hormozdiari Iman\u00a0Hajirasouliha and S\u00a0Cenk Sahinalp. 2008. Biomolecular network motif counting and discover by color coding. 10.1093\/bioinformatics\/btn163","DOI":"10.1093\/bioinformatics\/btn163"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","unstructured":"Ali Pinar C. Seshadhri and Vaidyanathan Vishal. 2017. ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. (2017) 1431\u20131440. 10.1145\/3038912.3052597","DOI":"10.1145\/3038912.3052597"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","unstructured":"Pedro Ribeiro Pedro Paredes Miguel E.\u00a0P. Silva David Aparicio and Fernando Silva. 2021. A Survey on Subgraph Counting: Concepts Algorithms and Applications to Network Motifs and Graphlets. ACM Comput. Surv. 54 2 Article 28 (March 2021). 10.1145\/3433652","DOI":"10.1145\/3433652"},{"key":"e_1_3_3_2_19_2","volume-title":"Counting problems and the inclusion-exclusion principle","author":"Sankaranarayanan S","year":"2015","unstructured":"S Sankaranarayanan and H Bennett. 2015. Counting problems and the inclusion-exclusion principle. Technical Report. Department of Computer Science, University of Colorado."},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3581784.3613213"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00104"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59003-14"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815410"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","unstructured":"Chad Voegele Yi-Shan Lu Sreepathi Pai and Keshav Pingali. 2017. Parallel triangle counting and k-truss identification using graph-centric methods. 2017 IEEE High Performance Extreme Computing Conference (HPEC) (2017). 10.1109\/HPEC.2017.8091037","DOI":"10.1109\/HPEC.2017.8091037"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/2915516.2915521"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","unstructured":"Yuanxu Wang Song Jinmiao Mingjie Wei and Xiaodong Duan. 2023. Predicting Potential Drug\u2013Disease Associations Based on Hypergraph Learning with Subgraph Matching. Interdisciplinary Sciences: Computational Life Sciences 15 (03 2023). 10.1007\/s12539-023-00556-0","DOI":"10.1007\/s12539-023-00556-0"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC41404.2022.00058"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"publisher","unstructured":"Lingfei Wu Yu Chen Kai Shen Xiaojie Guo Hanning Gao Shucheng Li Jian Pei and Bo Long. 2021. Graph Neural Networks for Natural Language Processing: A Survey. 10.48550\/ARXIV.2106.06090","DOI":"10.48550\/ARXIV.2106.06090"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3458817.3476214"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00244"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00112"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00064"}],"event":{"name":"SC '25: The International Conference for High Performance Computing, Networking, Storage and Analysis","location":"St. Louis MO USA","acronym":"SC '25","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"]},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712285.3759839","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712285.3759839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:34:57Z","timestamp":1773254097000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712285.3759839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,15]]},"references-count":31,"alternative-id":["10.1145\/3712285.3759839","10.1145\/3712285"],"URL":"https:\/\/doi.org\/10.1145\/3712285.3759839","relation":{},"subject":[],"published":{"date-parts":[[2025,11,15]]},"assertion":[{"value":"2025-11-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}