{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T14:53:43Z","timestamp":1777733623821,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Singapore Ministry of Education","award":["MOE2017-T2-1-141"],"award-info":[{"award-number":["MOE2017-T2-1-141"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3468791.3468796","type":"proceedings-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T01:03:56Z","timestamp":1628730236000},"page":"13-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Accelerating Depth-First Traversal by Graph Ordering"],"prefix":"10.1145","author":[{"given":"Qiuyi","family":"Lyu","sequence":"first","affiliation":[{"name":"Shandong University, China"}]},{"given":"Mo","family":"Sha","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]},{"given":"Bin","family":"Gong","sequence":"additional","affiliation":[{"name":"Shandong University, China"}]},{"given":"Kuangda","family":"Lyu","sequence":"additional","affiliation":[{"name":"Xidian University, China"}]}],"member":"320","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. LAW: The Laboratory for Web Algorithmics. http:\/\/law.di.unimi.it.  [n.d.]. LAW: The Laboratory for Web Algorithmics. http:\/\/law.di.unimi.it."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.110"},{"key":"e_1_3_2_1_3_1","volume-title":"Studying the Effect of Lightweight Graph Reordering Across Applications and Input Graphs. In 2018 IEEE International Symposium on Workload Characterization (IISWC).","author":"Balaji Vignesh","year":"2018","unstructured":"Vignesh Balaji and Brandon Lucia . 2018 . When is Graph Reordering an Optimization? Studying the Effect of Lightweight Graph Reordering Across Applications and Input Graphs. In 2018 IEEE International Symposium on Workload Characterization (IISWC). Vignesh Balaji and Brandon Lucia. 2018. When is Graph Reordering an Optimization? Studying the Effect of Lightweight Graph Reordering Across Applications and Input Graphs. In 2018 IEEE International Symposium on Workload Characterization (IISWC)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48054-0_9"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.587"},{"key":"e_1_3_2_1_6_1","unstructured":"Lijie Chen Ran Duan Ruosong Wang and Hanrui Zhang. 2016. Improved algorithms for maintaining DFS tree in undirected graphs. CoRR abs\/1607.04913(2016).  Lijie Chen Ran Duan Ruosong Wang and Hanrui Zhang. 2016. Improved algorithms for maintaining DFS tree in undirected graphs. CoRR abs\/1607.04913(2016)."},{"key":"e_1_3_2_1_7_1","volume-title":"Carlo Sansone, and Mario Vento","author":"Cordella P","year":"2004","unstructured":"Luigi\u00a0 P Cordella , Pasquale Foggia , Carlo Sansone, and Mario Vento . 2004 . A (sub) graph isomorphism algorithm for matching large graphs. IEEE transactions on pattern analysis and machine intelligence 26, 10(2004), 1367\u20131372. Luigi\u00a0P Cordella, Pasquale Foggia, Carlo Sansone, and Mario Vento. 2004. A (sub) graph isomorphism algorithm for matching large graphs. IEEE transactions on pattern analysis and machine intelligence 26, 10(2004), 1367\u20131372."},{"key":"e_1_3_2_1_8_1","volume-title":"Introduction to algorithms","author":"Cormen H","unstructured":"Thomas\u00a0 H Cormen , Charles\u00a0 E Leiserson , Ronald\u00a0 L Rivest , and Clifford Stein . 2009. Introduction to algorithms . MIT press . Thomas\u00a0H Cormen, Charles\u00a0E Leiserson, Ronald\u00a0L Rivest, and Clifford Stein. 2009. Introduction to algorithms. MIT press."},{"key":"e_1_3_2_1_9_1","unstructured":"Edsger\u00a0Wybe Dijkstra Edsger\u00a0Wybe Dijkstra Edsger\u00a0Wybe Dijkstra Etats-Unis Informaticien and Edsger\u00a0Wybe Dijkstra. 1976. A discipline of programming. Vol.\u00a01. prentice-hall Englewood Cliffs.  Edsger\u00a0Wybe Dijkstra Edsger\u00a0Wybe Dijkstra Edsger\u00a0Wybe Dijkstra Etats-Unis Informaticien and Edsger\u00a0Wybe Dijkstra. 1976. A discipline of programming. Vol.\u00a01. prentice-hall Englewood Cliffs."},{"key":"e_1_3_2_1_10_1","volume-title":"the 2016 International Conference on Manage of Data.","author":"Hao Wei","year":"2016","unstructured":"Wei Hao , Jeffrey\u00a0Xu Yu , Can Lu , and Xuemin Lin . 2016 . Speedup Graph Processing by Graph Ordering . In the 2016 International Conference on Manage of Data. Wei Hao, Jeffrey\u00a0Xu Yu, Can Lu, and Xuemin Lin. 2016. Speedup Graph Processing by Graph Ordering. In the 2016 International Conference on Manage of Data."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"e_1_3_2_1_12_1","unstructured":"J\u00e9r\u00f4me Kunegis. 2017. The Koblenz Network Collection.http:\/\/konect.uni-koblenz.de.  J\u00e9r\u00f4me Kunegis. 2017. The Koblenz Network Collection.http:\/\/konect.uni-koblenz.de."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2017.00039"},{"key":"e_1_3_2_1_14_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_15_1","first-page":"6","article-title":"Valgrind","volume":"42","author":"Nethercote Nicholas","year":"2007","unstructured":"Nicholas Nethercote and Julian Seward . 2007 . Valgrind : A Framework for Heavyweight Dynamic Binary Instrumentation. SIGPLAN Not. 42 , 6 (June 2007), 89\u2013100. https:\/\/doi.org\/10.1145\/1273442.1250746 Nicholas Nethercote and Julian Seward. 2007. Valgrind: A Framework for Heavyweight Dynamic Binary Instrumentation. SIGPLAN Not. 42, 6 (June 2007), 89\u2013100. https:\/\/doi.org\/10.1145\/1273442.1250746","journal-title":"A Framework for Heavyweight Dynamic Binary Instrumentation. SIGPLAN Not."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(81)90008-0"},{"key":"e_1_3_2_1_17_1","unstructured":"Jiao Su Qing Zhu Hao Wei and Jeffrey\u00a0Xu Yu. 2017. Reachability querying: can it be even faster?TKDE1(2017) 1\u20131.  Jiao Su Qing Zhu Hao Wei and Jeffrey\u00a0Xu Yu. 2017. Reachability querying: can it be even faster?TKDE1(2017) 1\u20131."},{"key":"e_1_3_2_1_18_1","series-title":"SIAM journal on computing 1, 2","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 1, 2 ( 1972 ), 146\u2013160. Robert Tarjan. 1972. Depth-first search and linear graph algorithms. SIAM journal on computing 1, 2 (1972), 146\u2013160."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00268499"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Robert\u00a0Endre Tarjan and TARJAN RE. 1974. A Note on Finding the Bridges of a Graph.(1974).  Robert\u00a0Endre Tarjan and TARJAN RE. 1974. A Note on Finding the Bridges of a Graph.(1974).","DOI":"10.1016\/0020-0190(74)90003-9"},{"key":"e_1_3_2_1_21_1","unstructured":"Alan Tucker. 2006. Chapter 2: covering circuits and graph colorings. Applied Combinatorics 49(2006).  Alan Tucker. 2006. Chapter 2: covering circuits and graph colorings. Applied Combinatorics 49(2006)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067429"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0468-3"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364329"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920879"},{"key":"e_1_3_2_1_26_1","volume-title":"Dagger: A scalable index for reachability queries in large dynamic graphs. arXiv preprint arXiv:1301.0977(2013).","author":"Yildirim Hilmi","year":"2013","unstructured":"Hilmi Yildirim , Vineet Chaoji , and Mohammed\u00a0 J Zaki . 2013 . Dagger: A scalable index for reachability queries in large dynamic graphs. arXiv preprint arXiv:1301.0977(2013). Hilmi Yildirim, Vineet Chaoji, and Mohammed\u00a0J Zaki. 2013. Dagger: A scalable index for reachability queries in large dynamic graphs. arXiv preprint arXiv:1301.0977(2013)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2017.8257937"},{"key":"e_1_3_2_1_28_1","unstructured":"Andy\u00a0Diwen Zhu Wenqing Lin Sibo Wang and Xiaokui Xiao. 2014. Reachability queries on large dynamic graphs: a total order approach. In SIGMOD. ACM 1323\u20131334.  Andy\u00a0Diwen Zhu Wenqing Lin Sibo Wang and Xiaokui Xiao. 2014. Reachability queries on large dynamic graphs: a total order approach. In SIGMOD. ACM 1323\u20131334."}],"event":{"name":"SSDBM 2021: 33rd International Conference on Scientific and Statistical Database Management","location":"Tampa FL USA","acronym":"SSDBM 2021"},"container-title":["33rd International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3468791.3468796","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3468791.3468796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:21Z","timestamp":1750191441000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3468791.3468796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":28,"alternative-id":["10.1145\/3468791.3468796","10.1145\/3468791"],"URL":"https:\/\/doi.org\/10.1145\/3468791.3468796","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}