{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:44:29Z","timestamp":1766220269409,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","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,9,8]]},"DOI":"10.1145\/3754598.3754620","type":"proceedings-article","created":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:34:32Z","timestamp":1766219672000},"page":"157-167","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Exact Diameter Computation of Sparse Graphs"],"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5116-1109","authenticated-orcid":false,"given":"Anju","family":"Mongandampulath Akathoott","sequence":"additional","affiliation":[{"name":"Texas State University, San Marcos, USA"}]},{"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"}]}],"member":"320","published-online":{"date-parts":[[2025,12,20]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-319-20086-6_5","volume-title":"Experimental Algorithms","author":"Akiba Takuya","year":"2015","unstructured":"Takuya Akiba, Yoichi Iwata, and Yuki Kawata. 2015. An Exact Algorithm for Diameters of Large Real Directed Graphs. In Experimental Algorithms, Evripidis Bampis (Ed.). Springer International Publishing, Cham, 56\u201367."},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.50"},{"key":"e_1_3_3_2_4_2","unstructured":"Fan\u00a0RK Chung. 1987. Diameters of graphs: Old problems and new results. Congressus Numerantium 60 2 (1987) 295\u2013317."},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"crossref","unstructured":"Pilu Crescenzi Roberto Grossi Michel Habib Leonardo Lanzi and Andrea Marino. 2013. On computing the diameter of real-world undirected graphs. Theoretical Computer Science 514 (2013) 84\u201395.","DOI":"10.1016\/j.tcs.2012.09.018"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451130"},{"key":"e_1_3_3_2_7_2","unstructured":"DIMACS. 2006. Center for Discrete Mathematics and Theoretical Computer Science at the University of Rome (DIMACS). https:\/\/www.diag.uniroma1.it\/challenge9\/download.shtml. Accessed: 2025-04-30."},{"key":"e_1_3_3_2_8_2","unstructured":"Jack Dongarra. 2000. Compressed row storage. http:\/\/www.netlib.org\/utk\/people\/JackDongarra\/etemplates\/node373.html. Accessed: 2025-2-26."},{"key":"e_1_3_3_2_9_2","unstructured":"Leo Egghe and Ronald Rousseau. 2024. The small-world phenomenon: a model explanations characterizations and examples. arxiv:https:\/\/arXiv.org\/abs\/2402.10233\u00a0[cs.SI] https:\/\/arxiv.org\/abs\/2402.10233"},{"key":"e_1_3_3_2_10_2","unstructured":"Galois. 2018. https:\/\/iss.oden.utexas.edu\/?p=projects\/galois\/download"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","unstructured":"Richard\u00a0E. Korf. 2021. Finding the Exact Diameter of a Graph with Partial Breadth-First Searches. Proceedings of the International Symposium on Combinatorial Search 12 1 (Jul. 2021) 73\u201378. 10.1609\/socs.v12i1.18553","DOI":"10.1609\/socs.v12i1.18553"},{"key":"e_1_3_3_2_12_2","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. Accessed: 2025-04-30."},{"key":"e_1_3_3_2_13_2","first-page":"1","volume-title":"Proceedings of the International Conference on Communications in Computing (CIC-2000)","author":"Parhami Behrooz","year":"2000","unstructured":"Behrooz Parhami and Chi-Hsiang Yeh. 2000. Why Network Diameter is Still Important. In Proceedings of the International Conference on Communications in Computing (CIC-2000) (Las Vegas, Nevada, USA). CSREA Press, 1\u20134. https:\/\/api.semanticscholar.org\/CorpusID:16765597"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","unstructured":"Georgios\u00a0A Pavlopoulos Maria Secrier Charalampos\u00a0N Moschopoulos Theodoros\u00a0G Soldatos Sophia Kossida Jan Aerts Reinhard Schneider and Pantelis\u00a0G Bagos. 2011. Using graph theory to analyze biological networks - biodata mining. 10.1186\/1756-0381-4-10","DOI":"10.1186\/1756-0381-4-10"},{"key":"e_1_3_3_2_15_2","volume-title":"Proceedings of the 1st High Performance Graph Mining Workshop (HPGM)","author":"Pennycuff Corey","year":"2015","unstructured":"Corey Pennycuff and Tim Weninger. 2015. Fast, exact graph diameter computation with vertex programming. In Proceedings of the 1st High Performance Graph Mining Workshop (HPGM). https:\/\/api.semanticscholar.org\/CorpusID:18390525"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488673"},{"key":"e_1_3_3_2_17_2","unstructured":"M.\u00a0Puck Rombach Mason\u00a0A. Porter James\u00a0H. Fowler and Peter\u00a0J. Mucha. 2013. Core-Periphery Structure in Networks. arxiv:https:\/\/arXiv.org\/abs\/1202.2684\u00a0[cs.SI] https:\/\/arxiv.org\/abs\/1202.2684"},{"key":"e_1_3_3_2_18_2","unstructured":"SuiteSparse Matrix Collection. 2019. https:\/\/sparse.tamu.edu\/ Accessed: 2025-04-30."},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/CANDAR.2019.00020"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICIRT.2013.6696309"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICICN59530.2023.10392303"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/APCIP.2009.79"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/SCW63240.2024.00090"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/CCBD.2015.19"}],"event":{"name":"ICPP '25: 54th International Conference on Parallel Processing","location":"San Diego CA USA","acronym":"ICPP '25"},"container-title":["Proceedings of the 54th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3754598.3754620","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:39:50Z","timestamp":1766219990000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3754598.3754620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,8]]},"references-count":23,"alternative-id":["10.1145\/3754598.3754620","10.1145\/3754598"],"URL":"https:\/\/doi.org\/10.1145\/3754598.3754620","relation":{},"subject":[],"published":{"date-parts":[[2025,9,8]]},"assertion":[{"value":"2025-12-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}