{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T02:39:45Z","timestamp":1777430385575,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T00:00:00Z","timestamp":1652745600000},"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":[[2022,5,17]]},"DOI":"10.1145\/3528416.3530247","type":"proceedings-article","created":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T02:16:59Z","timestamp":1651717019000},"page":"131-140","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient trimming for strongly connected components calculation"],"prefix":"10.1145","author":[{"given":"Dante","family":"Niewenhuis","sequence":"first","affiliation":[{"name":"University of Amsterdam, Amsterdam, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana-Lucia","family":"Varbanescu","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, University of Twente, Enschede, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"USA: Addison-Wesley.","author":"Alfred V Aho","year":"1983","unstructured":"V Aho Alfred, E Hopcroft John, D Ullman Jeffrey, V Aho Alfred, H Bracht Glenn, D Hopkin Kenneth, C Stanley Julian, Brachu Jean-Pierre, Brown A Samler, Brown A Peter, et al. 1983. Data structures and algorithms. USA: Addison-Wesley."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.0030-1299.2005.13082.x"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.59"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78963"},{"key":"e_1_3_2_1_5_1","volume-title":"A Divide-And-Conquer Algorithm For Identifying Strongly Connected Components","author":"Coppersmith Don","year":"2006","unstructured":"Don Coppersmith, Lisa K. Fleischer, Bruce Hendrickson, and Ali Pinar. 2001. A Divide-And-Conquer Algorithm For Identifying Strongly Connected Components. January 2006 (2001), 1--9."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884045.2884048"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/155271.155273"},{"key":"e_1_3_2_1_8_1","volume-title":"Lifeng Nai, Michael J. Anderson, Mihai Capota, Narayanan Sundaram, Peter A. Boncz, Siegfried Depner, Stijn Heldens, Thomas Manhardt, Tim Hegeman, Wing Lung Ngai, and Yinglong Xia.","author":"Iosup Alexandru","year":"2020","unstructured":"Alexandru Iosup, Ahmed Musaafir, Alexandru Uta, Arnau Prat-P\u00e9rez, G\u00e1bor Sz\u00e1rnyas, Hassan Chafi, Ilie Gabriel Tanase, Lifeng Nai, Michael J. Anderson, Mihai Capota, Narayanan Sundaram, Peter A. Boncz, Siegfried Depner, Stijn Heldens, Thomas Manhardt, Tim Hegeman, Wing Lung Ngai, and Yinglong Xia. 2020. The LDBC Graphalytics Benchmark. CoRR abs\/2011.15028 (2020). arXiv:2011.15028 https:\/\/arxiv.org\/abs\/2011.15028"},{"key":"e_1_3_2_1_9_1","volume-title":"International Conference on Neural Information Processing. Springer, 829--834","author":"Kazemitabar Seyed Jalal","year":"2008","unstructured":"Seyed Jalal Kazemitabar and Hamid Beigy. 2008. Automatic discovery of subgoals in reinforcement learning using strongly connected components. In International Conference on Neural Information Processing. Springer, 829--834."},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. Int. Conf. on World Wide Web Companion. 1343--1350","author":"Kunegis J\u00e9r\u00f4me","year":"2013","unstructured":"J\u00e9r\u00f4me Kunegis. 2013. KONECT - The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion. 1343--1350. http:\/\/dl.acm.org\/citation.cfm?id=2488173"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2013.10.014"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.03.007"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290520.1290524"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2803818"},{"key":"e_1_3_2_1_16_1","volume-title":"Ahmed","author":"Rossi Ryan A.","year":"2015","unstructured":"Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. http:\/\/networkrepository.com"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378560"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.64"},{"key":"e_1_3_2_1_19_1","series-title":"SIAM journal on computing 1, 2","volume-title":"Depth-first search and linear graph algorithms","author":"Tarjan R","year":"1972","unstructured":"R Tarjan. 1972. Depth-first search and linear graph algorithms. SIAM journal on computing 1, 2 (1972), 146--160."},{"key":"e_1_3_2_1_20_1","volume-title":"Ana Lucia Varbanescu, and Cees de Laat","author":"Verstraaten Merijn","year":"2015","unstructured":"Merijn Verstraaten, Ana Lucia Varbanescu, and Cees de Laat. 2015. Quantifying the Performance Impact of Graph Structure on Neighbour Iteration Strategies for PageRank. In Euro-Par 2015: Parallel Processing Workshops (Lecture Notes in Computer Science, Vol. 9523). Springer, 528--540."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/IA3.2018.00014"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-016-0246-7"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.11897\/SP.J.1016.2017.00584"}],"event":{"name":"CF '22: 19th ACM International Conference on Computing Frontiers","location":"Turin Italy","acronym":"CF '22","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"]},"container-title":["Proceedings of the 19th ACM International Conference on Computing Frontiers"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528416.3530247","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3528416.3530247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:42Z","timestamp":1750186962000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528416.3530247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,17]]},"references-count":23,"alternative-id":["10.1145\/3528416.3530247","10.1145\/3528416"],"URL":"https:\/\/doi.org\/10.1145\/3528416.3530247","relation":{},"subject":[],"published":{"date-parts":[[2022,5,17]]},"assertion":[{"value":"2022-05-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}