{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T11:50:34Z","timestamp":1781005834094,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T00:00:00Z","timestamp":1592870400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["1350766, 1618706, 1717774"],"award-info":[{"award-number":["1350766, 1618706, 1717774"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,23]]},"DOI":"10.1145\/3369583.3392690","type":"proceedings-article","created":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T03:27:27Z","timestamp":1592796447000},"page":"149-160","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Aquila: Adaptive Parallel Computation of Graph Connectivity Queries"],"prefix":"10.1145","author":[{"given":"Yuede","family":"Ji","sequence":"first","affiliation":[{"name":"George Washington University, Washington, DC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H. Howie","family":"Huang","sequence":"additional","affiliation":[{"name":"George Washington University, Washington, DC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,6,23]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Gtgraph: A synthetic graph generator suite.","author":"Bader David A","year":"2006","unstructured":"David A Bader and Kamesh Madduri. 2006. Gtgraph: A synthetic graph generator suite. (2006)."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807668"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.50"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300086"},{"key":"e_1_3_2_2_5_1","volume-title":"Proceedings of PPoPP","author":"Bloemen Vincent","year":"2016","unstructured":"Vincent Bloemen, Alfons Laarman, and Jaco van de Pol. 2016. Multi-core on-the-fly SCC decomposition. Proceedings of PPoPP (2016)."},{"key":"e_1_3_2_2_6_1","volume-title":"Proceedings of SPAA","author":"Bulucc Aydin","year":"2009","unstructured":"Aydin Bulucc, Jeremy T Fineman, Matteo Frigo, John R Gilbert, and Charles E Leiserson. 2009. Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks. Proceedings of SPAA (2009)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/35.587723"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-014-0330-9"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653776"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2741948.2741970"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465286"},{"key":"e_1_3_2_2_13_1","volume-title":"Proceedings of IPDPS","author":"Cong Guojing","year":"2005","unstructured":"Guojing Cong and David A Bader. 2005. An experimental study of parallel biconnected components algorithms on symmetric multiprocessors (SMPs). Proceedings of IPDPS (2005)."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2141702.2141714"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2016.23185"},{"key":"e_1_3_2_2_17_1","series-title":"SIAM journal on computing","volume-title":"Network flow and testing graph connectivity","author":"Even Shimon","year":"1975","unstructured":"Shimon Even and R Endre Tarjan. 1975. Network flow and testing graph connectivity. SIAM journal on computing (1975)."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45591-4_68"},{"key":"e_1_3_2_2_19_1","volume-title":"Proceedings of OSDI","author":"Gonzalez Joseph E","year":"2012","unstructured":"Joseph E Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. Powergraph: Distributed graph-parallel computation on natural graphs. Proceedings of OSDI (2012)."},{"key":"e_1_3_2_2_20_1","volume-title":"Proceedings of OSDI","author":"Gonzalez Joseph E","year":"2014","unstructured":"Joseph E Gonzalez, Reynold S Xin, Ankur Dave, Daniel Crankshaw, Michael J Franklin, and Ion Stoica. 2014. Graphx: Graph processing in a distributed dataflow framework. Proceedings of OSDI (2014)."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Aric Hagberg Pieter Swart and Daniel S Chult. 2008. Exploring network structure dynamics and function using NetworkX. (2008).","DOI":"10.25080\/TCWV9851"},{"key":"e_1_3_2_2_22_1","volume-title":"Fast connected-component labeling. Pattern recognition","author":"He Lifeng","year":"2009","unstructured":"Lifeng He, Yuyan Chao, Kenji Suzuki, and Kesheng Wu. 2009. Fast connected-component labeling. Pattern recognition (2009)."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503246"},{"key":"e_1_3_2_2_24_1","volume-title":"Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM","author":"Hopcroft John","year":"1973","unstructured":"John Hopcroft and Robert Tarjan. 1973. Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM (1973)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCC.2019.00014"},{"key":"e_1_3_2_2_26_1","volume-title":"Combating the evasion mechanisms of social bots. Computers & Security","author":"Ji Yuede","year":"2016","unstructured":"Yuede Ji, Yukun He, Xinyang Jiang, Jian Cao, and Qiang Li. 2016. Combating the evasion mechanisms of social bots. Computers & Security (2016)."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/K18-2025"},{"key":"e_1_3_2_2_28_1","volume-title":"Proceedings of ICNP","author":"Nan","year":"2010","unstructured":"Nan Jiang et al. 2010. Identifying suspicious activities through dns failure graph analysis. Proceedings of ICNP (2010)."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250759"},{"key":"e_1_3_2_2_30_1","volume-title":"Proceedings of FAST","author":"Kumar Pradeep","year":"2019","unstructured":"Pradeep Kumar and H Howie Huang. 2019. GraphOne: A data store for real-time analytics on evolving graphs. Proceedings of FAST (2019)."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_2_32_1","volume-title":"Proceedings of OSDI","author":"Kyrola Aapo","year":"2012","unstructured":"Aapo Kyrola, Guy Blelloch, and Carlos Guestrin. 2012. GraphChi: Large-Scale Graph Computation on Just a PC. Proceedings of OSDI (2012)."},{"key":"e_1_3_2_2_33_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (2014)."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807594"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16766-8_4"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"William Mclendon Iii Bruce Hendrickson Steven J Plimpton and Lawrence Rauchwerger. 2005. Finding strongly connected components in distributed graphs. J. Parallel and Distrib. Comput. (2005).","DOI":"10.1016\/j.jpdc.2005.03.007"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"John H Reif. 1985. Depth-first search is inherently sequential. Inform. Process. Lett. (1985).","DOI":"10.1016\/0020-0190(85)90024-9"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_2_40_1","volume-title":"Social network analysis. Sociology","author":"Scott John","year":"1988","unstructured":"John Scott. 1988. Social network analysis. Sociology (1988)."},{"key":"e_1_3_2_2_41_1","unstructured":"Yossi Shiloach and Uzi Vishkin. 1980. An O (log n) parallel connectivity algorithm. (1980)."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_2_43_1","unstructured":"Jeremy Siek Andrew Lumsdaine and Lie-Quan Lee. 2002. The boost graph library: user guide and reference manual. (2002)."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2014.7116914"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.64"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159696"},{"key":"e_1_3_2_2_47_1","series-title":"SIAM journal on computing","volume-title":"Depth-first search and linear graph algorithms","author":"Tarjan Robert","year":"1972","unstructured":"Robert Tarjan. 1972. Depth-first search and linear graph algorithms. SIAM journal on computing (1972)."},{"key":"e_1_3_2_2_48_1","series-title":"SIAM J. Comput. (1985)","volume-title":"An efficient parallel biconnectivity algorithm","author":"Tarjan Robert E","unstructured":"Robert E Tarjan and Uzi Vishkin. 1985. An efficient parallel biconnectivity algorithm. SIAM J. Comput. (1985)."},{"key":"e_1_3_2_2_49_1","series-title":"SIAM J. Comput. (1984)","volume-title":"Efficient parallel algorithms for a class of graph theoretic problems","author":"Tsin Yung H","unstructured":"Yung H Tsin and Francis Y Chin. 1984. Efficient parallel algorithms for a class of graph theoretic problems. SIAM J. Comput. (1984)."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851154"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879148"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0372-z"},{"key":"e_1_3_2_2_53_1","volume-title":"Proceedings of NSDI","author":"Zhao Yao","year":"2009","unstructured":"Yao Zhao, Yinglian Xie, Fang Yu, Qifa Ke, Yuan Yu, Yan Chen, and Eliot Gillum. 2009. BotGraph: Large Scale Spamming Botnet Detection. Proceedings of NSDI (2009)."}],"event":{"name":"HPDC '20: The 29th International Symposium on High-Performance Parallel and Distributed Computing","location":"Stockholm Sweden","acronym":"HPDC '20","sponsor":["University of Arizona University of Arizona","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 29th International Symposium on High-Performance Parallel and Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3369583.3392690","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3369583.3392690","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3369583.3392690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:07Z","timestamp":1750200067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3369583.3392690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,23]]},"references-count":52,"alternative-id":["10.1145\/3369583.3392690","10.1145\/3369583"],"URL":"https:\/\/doi.org\/10.1145\/3369583.3392690","relation":{},"subject":[],"published":{"date-parts":[[2020,6,23]]},"assertion":[{"value":"2020-06-23","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}