{"id":"https://openalex.org/W7116406487","doi":"https://doi.org/10.1145/3754598.3754620","title":"Fast Exact Diameter Computation of Sparse Graphs","display_name":"Fast Exact Diameter Computation of Sparse Graphs","publication_year":2025,"publication_date":"2025-09-08","ids":{"openalex":"https://openalex.org/W7116406487","doi":"https://doi.org/10.1145/3754598.3754620"},"language":null,"primary_location":{"id":"doi:10.1145/3754598.3754620","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3754598.3754620","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th International Conference on Parallel Processing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3754598.3754620","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120875715","display_name":"Cameron Bradley","orcid":null},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Cameron Bradley","raw_affiliation_strings":["Texas State University, San Marcos, USA"],"raw_orcid":"https://orcid.org/0009-0004-2137-0999","affiliations":[{"raw_affiliation_string":"Texas State University, San Marcos, USA","institution_ids":["https://openalex.org/I13511017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113347965","display_name":"Anju Mongandampulath Akathoott","orcid":null},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anju Mongandampulath Akathoott","raw_affiliation_strings":["Texas State University, San Marcos, USA"],"raw_orcid":"https://orcid.org/0000-0002-5116-1109","affiliations":[{"raw_affiliation_string":"Texas State University, San Marcos, USA","institution_ids":["https://openalex.org/I13511017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103125276","display_name":"Martin Burtscher","orcid":"https://orcid.org/0000-0001-7717-3354"},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Burtscher","raw_affiliation_strings":["Texas State University, San Marcos, USA"],"raw_orcid":"https://orcid.org/0000-0001-7717-3354","affiliations":[{"raw_affiliation_string":"Texas State University, San Marcos, USA","institution_ids":["https://openalex.org/I13511017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5120875715"],"corresponding_institution_ids":["https://openalex.org/I13511017"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.60400506,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"157","last_page":"167"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.8716999888420105,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.8716999888420105,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.024800000712275505,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.016599999740719795,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5839999914169312},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5458999872207642},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48899999260902405},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4575999975204468},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3833000063896179},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3804999887943268},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.36410000920295715},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.3472999930381775},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.34310001134872437}],"concepts":[{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5839999914169312},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5458999872207642},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5270000100135803},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48899999260902405},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47940000891685486},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4575999975204468},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38580000400543213},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3833000063896179},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38260000944137573},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3804999887943268},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.36410000920295715},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3472999930381775},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.34310001134872437},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.3352999985218048},{"id":"https://openalex.org/C134727501","wikidata":"https://www.wikidata.org/wiki/Q5597073","display_name":"Graph bandwidth","level":5,"score":0.32249999046325684},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3050999939441681},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30070000886917114},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C2988809283","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Combinatorial algorithms","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.27300000190734863},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.2709999978542328},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.26669999957084656},{"id":"https://openalex.org/C520416788","wikidata":"https://www.wikidata.org/wiki/Q5419229","display_name":"Exact solutions in general relativity","level":2,"score":0.26460000872612},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.26109999418258667},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25769999623298645},{"id":"https://openalex.org/C2778400913","wikidata":"https://www.wikidata.org/wiki/Q1639024","display_name":"Mathematical software","level":3,"score":0.25049999356269836},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2502000033855438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3754598.3754620","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3754598.3754620","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th International Conference on Parallel Processing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3754598.3754620","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3754598.3754620","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th International Conference on Parallel Processing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W745517244","https://openalex.org/W2044124066","https://openalex.org/W2047489708","https://openalex.org/W2091323891","https://openalex.org/W2106474670","https://openalex.org/W2139928554","https://openalex.org/W2315942971","https://openalex.org/W3000743706","https://openalex.org/W3171428299","https://openalex.org/W3198849513","https://openalex.org/W4253426709","https://openalex.org/W4391184623","https://openalex.org/W4406157024"],"related_works":[],"abstract_inverted_index":{"The":[0,21],"diameter":[1,27,95],"of":[2,18,49,75,96,111,118,125,135],"a":[3,6,38,59,85],"graph":[4,19],"is":[5,28,42,53,120],"fundamental":[7],"topological":[8],"parameter":[9],"that":[10,41],"provides":[11],"valuable":[12],"insight":[13],"needed":[14],"in":[15,46],"multiple":[16],"areas":[17],"analytics.":[20],"traditional":[22],"approach":[23],"to":[24,71,79,106],"computing":[25,92],"the":[26,30,47,50,73,81,93,109,123,126],"solving":[29],"all-pairs":[31],"shortest-paths":[32],"problem":[33],"(APSP).":[34],"Since":[35],"APSP":[36],"has":[37],"time":[39],"complexity":[40],"at":[43],"least":[44],"quadratic":[45],"size":[48],"graph,":[51],"it":[52],"impractical":[54],"for":[55,90],"large":[56,97],"graphs.":[57,98],"As":[58],"remedy,":[60],"leading":[61],"algorithms":[62],"use":[63],"Breadth-First":[64],"Search":[65],"(BFS)":[66],"combined":[67],"with":[68],"various":[69],"optimizations":[70],"limit":[72],"number":[74,110],"BFS":[76,112],"calls":[77],"required":[78],"find":[80],"diameter.":[82],"We":[83],"present":[84],"new":[86,101],"algorithm":[87],"called":[88],"F-Diam":[89,119],"quickly":[91],"exact":[94],"It":[99],"includes":[100],"techniques":[102],"such":[103],"as":[104],"Winnowing":[105],"greatly":[107],"reduce":[108],"calls.":[113],"Our":[114],"parallel":[115],"CPU":[116],"implementation":[117],"faster":[121],"than":[122],"state":[124],"art":[127],"on":[128],"all":[129],"tested":[130],"inputs,":[131],"often":[132],"by":[133],"orders":[134],"magnitude.":[136]},"counts_by_year":[],"updated_date":"2025-12-21T02:06:08.432651","created_date":"2025-12-21T00:00:00"}