{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:11:59Z","timestamp":1779174719024,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T00:00:00Z","timestamp":1594080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,7]]},"DOI":"10.1145\/3400903.3400931","type":"proceedings-article","created":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T21:20:29Z","timestamp":1596144029000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Vectorising k-Core Decomposition for GPU Acceleration"],"prefix":"10.1145","author":[{"given":"Amir","family":"Mehrafsa","sequence":"first","affiliation":[{"name":"University of Victoria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sean","family":"Chester","sequence":"additional","affiliation":[{"name":"University of Victoria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Thomo","sequence":"additional","affiliation":[{"name":"University of Victoria, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Mohammad Almasri et al. 2019. Update on k-truss Decomposition on GPU. In HPEC. 1\u20137.  Mohammad Almasri et al. 2019. Update on k-truss Decomposition on GPU. In HPEC. 1\u20137.","DOI":"10.1109\/HPEC.2019.8916285"},{"key":"e_1_3_2_1_2_1","unstructured":"Vladimir Batagelj and Matja\u017e Zaver\u0161nik. 2003. An O(m) Algorithm for Cores Decomposition of Networks. arxiv:cs\/0310049  Vladimir Batagelj and Matja\u017e Zaver\u0161nik. 2003. An O(m) Algorithm for Cores Decomposition of Networks. arxiv:cs\/0310049"},{"key":"e_1_3_2_1_3_1","unstructured":"Naga\u00a0Shailaja Dasari et al. 2014. ParK: An efficient algorithm for k-core decomposition on multicore processors. In Big Data9\u201316.  Naga\u00a0Shailaja Dasari et al. 2014. ParK: An efficient algorithm for k-core decomposition on multicore processors. In Big Data9\u201316."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087580"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Laxman Dhulipala et al. 2018. Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. In SPAA \u201918393\u2013404.  Laxman Dhulipala et al. 2018. Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. In SPAA \u201918393\u2013404.","DOI":"10.1145\/3210377.3210414"},{"key":"e_1_3_2_1_6_1","first-page":"358","article-title":"Relational Approach for Shortest Path Discovery over Large Graphs","volume":"5","author":"Jun Gao","year":"2011","unstructured":"Jun Gao et al. 2011 . Relational Approach for Shortest Path Discovery over Large Graphs . PVLDB 5 , 4 (2011), 358 \u2013 369 . Jun Gao et al. 2011. Relational Approach for Shortest Path Discovery over Large Graphs. PVLDB 5, 4 (2011), 358\u2013369.","journal-title":"PVLDB"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Humayun Kabir and Kamesh Madduri. 2017. Parallel k-Core Decomposition on Multicore Platforms. In IPDPSW. 1482\u20131491.  Humayun Kabir and Kamesh Madduri. 2017. Parallel k-Core Decomposition on Multicore Platforms. In IPDPSW. 1482\u20131491.","DOI":"10.1109\/IPDPSW.2017.151"},{"key":"e_1_3_2_1_8_1","first-page":"1","article-title":"K-core Decomposition of Large Networks on a Single PC","volume":"9","author":"Wissam Khaouid","year":"2015","unstructured":"Wissam Khaouid et al. 2015 . K-core Decomposition of Large Networks on a Single PC . PVLDB 9 , 1 (Sept. 2015), 13\u201323. Wissam Khaouid et al. 2015. K-core Decomposition of Large Networks on a Single PC. PVLDB 9, 1 (Sept. 2015), 13\u201323.","journal-title":"PVLDB"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.124"},{"key":"e_1_3_2_1_11_1","first-page":"1918","article-title":"Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs","volume":"6","author":"Mohamed Sarwat","year":"2013","unstructured":"Mohamed Sarwat et al. 2013 . Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs . PVLDB 6 , 14 (2013), 1918 \u2013 1929 . Mohamed Sarwat et al. 2013. Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs. PVLDB 6, 14 (2013), 1918\u20131929.","journal-title":"PVLDB"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Alok Tripathy et al. 2018. Scalable K-Core Decomposition for Static Graphs Using a Dynamic Graph Data Structure. In Big Data. 1134\u20131141.  Alok Tripathy et al. 2018. Scalable K-Core Decomposition for Static Graphs Using a Dynamic Graph Data Structure. In Big Data. 1134\u20131141.","DOI":"10.1109\/BigData.2018.8622056"},{"key":"e_1_3_2_1_13_1","volume-title":"Python Data Science Handbook: Essential Tools for Working with Data","author":"Jake VanderPlas","unstructured":"Jake VanderPlas . 2016. Python Data Science Handbook: Essential Tools for Working with Data ( 1 st ed.). O\u2019Reilly Media, Inc. , Boston, MA , 78\u201383. Jake VanderPlas. 2016. Python Data Science Handbook: Essential Tools for Working with Data (1st ed.). O\u2019Reilly Media, Inc., Boston, MA, 78\u201383.","edition":"1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Chad Voegele et al. 2017. Parallel triangle counting and k-truss identification using graph-centric methods. In HPEC. 1\u20137.  Chad Voegele et al. 2017. Parallel triangle counting and k-truss identification using graph-centric methods. In HPEC. 1\u20137.","DOI":"10.1109\/HPEC.2017.8091037"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Heng Zhang et al. 2017. Accelerating Core Decomposition in Large Temporal Networks Using GPUs. In Neural Information Processing 893\u2013903.  Heng Zhang et al. 2017. Accelerating Core Decomposition in Large Temporal Networks Using GPUs. In Neural Information Processing 893\u2013903.","DOI":"10.1007\/978-3-319-70087-8_91"}],"event":{"name":"SSDBM 2020: 32nd International Conference on Scientific and Statistical Database Management","location":"Vienna Austria","acronym":"SSDBM 2020"},"container-title":["32nd International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3400903.3400931","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3400903.3400931","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:17Z","timestamp":1750200077000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3400903.3400931"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,7]]},"references-count":15,"alternative-id":["10.1145\/3400903.3400931","10.1145\/3400903"],"URL":"https:\/\/doi.org\/10.1145\/3400903.3400931","relation":{},"subject":[],"published":{"date-parts":[[2020,7,7]]},"assertion":[{"value":"2020-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}