{"id":"https://openalex.org/W7164019186","doi":"https://doi.org/10.48550/arxiv.2606.08217","title":"Revisiting Diameter in Directed Graphs","display_name":"Revisiting Diameter in Directed Graphs","publication_year":2026,"publication_date":"2026-06-06","ids":{"openalex":"https://openalex.org/W7164019186","doi":"https://doi.org/10.48550/arxiv.2606.08217"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.08217","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.08217","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.08217","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053507894","display_name":"Ben Bals","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bals, Ben","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138235558","display_name":"Joakim Blikstad","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Blikstad, Joakim","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044591096","display_name":"Daniel Dadush","orcid":"https://orcid.org/0000-0001-5577-5012"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dadush, Daniel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012259594","display_name":"Yasamin Nazari","orcid":"https://orcid.org/0000-0003-1315-9355"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nazari, Yasamin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138242836","display_name":"Jonas Schmidt","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schmidt, Jonas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6122000217437744,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6122000217437744,"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.3102000057697296,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.00860000029206276,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/reachability","display_name":"Reachability","score":0.7304999828338623},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.7042999863624573},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6776999831199646},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.534600019454956},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.49140000343322754},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4799000024795532},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.42890000343322754},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42590001225471497},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4253999888896942},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.41780000925064087}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7455000281333923},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7304999828338623},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7042999863624573},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6822999715805054},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6776999831199646},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.544700026512146},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.534600019454956},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.49140000343322754},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4799000024795532},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.42890000343322754},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42590001225471497},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4253999888896942},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.41780000925064087},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4131999909877777},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.41200000047683716},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.40540000796318054},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.38029998540878296},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.3747999966144562},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.37299999594688416},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3619000017642975},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.3596000075340271},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3499999940395355},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.3361000120639801},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.33000001311302185},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.3292999863624573},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.32019999623298645},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.3000999987125397},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.26030001044273376},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2556000053882599},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.25029999017715454},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2500999867916107}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.08217","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.08217","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.08217","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.08217","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"reachability":[1,111],"diameter":[2,56,73,112,194],"($\\mathrm{ReachDiam}$)":[3],"of":[4,29,55,72,107,118,139,172,193,248],"a":[5,51,114,180],"directed":[6,58,75],"graph":[7,99,213],"is":[8,18,24,50,64,128,146],"the":[9,27,33,89,105,109,184,203],"maximum":[10],"distance":[11],"over":[12],"all":[13],"pairs":[14],"$u,v$":[15],"where":[16],"$v$":[17],"reachable":[19],"from":[20,113],"$u$.":[21],"This":[22,245],"notion":[23,54],"present":[25],"in":[26,38,57,74,81,96,131,141,156,196,205],"definition":[28],"shortcut":[30,263],"sets,":[31],"and":[32,44,60,186,215,246,261,265],"name":[34],"was":[35],"recently":[36],"coined":[37],"that":[39,83,126,135,167],"context":[40],"by":[41],"Haeupler,":[42],"Jiang,":[43],"Saranurak":[45],"[SOSA":[46],"2026].":[47],"While":[48],"this":[49,157,191],"very":[52],"natural":[53],"graphs,":[59,208],"especially":[61],"DAGs,":[62],"it":[63],"so":[65],"far":[66],"not":[67,85],"computationally":[68],"explored.":[69],"Other":[70],"definitions":[71],"graphs":[76,82,155,226,254],"are":[77,84,93],"either":[78],"trivial":[79],"(infinite)":[80],"strongly":[86],"connected":[87],"(e.g.,":[88,101],"classical":[90],"definition)":[91],"or":[92,225],"non-trivial":[94],"only":[95],"highly":[97],"restrictive":[98],"classes":[100,214],"Min-Diameter).":[102],"We":[103],"initiate":[104],"problem":[106],"computing":[108,262],"(approximate)":[110],"fine-grained":[115,122],"complexity":[116],"point":[117],"view.":[119],"Under":[120],"certain":[121],"assumptions,":[123],"we":[124,162,178,209],"prove":[125],"there":[127,145],"no":[129,147],"algorithm":[130,148],"time":[132],"$\\mathcal{O}(n^{\u03c9-":[133],"\\varepsilon}$)":[134],"gives":[136],"any":[137],"approximation":[138,171],"$\\mathrm{ReachDiam}$":[140,173,260],"weighted":[142,185,207],"graphs.":[143,176,244],"Similarly,":[144],"with":[149,222,227,238],"better":[150],"than":[151,198],"$2$-approximation":[152],"for":[153,174,220,241,252],"unweighted":[154,175,187],"time.":[158],"To":[159],"supplement":[160],"this,":[161],"provide":[163],"algorithmic":[164],"upper":[165,250],"bounds":[166,251],"lead":[168,234],"to":[169,235],"additive":[170],"Hence,":[177],"establish":[179],"strong":[181],"separation":[182],"between":[183,258],"cases,":[188],"which":[189],"makes":[190],"type":[192],"different":[195],"nature":[197],"other":[199],"known":[200],"notions.":[201],"Considering":[202],"hardness":[204],"general":[206,253],"also":[210,233],"study":[211],"special":[212],"get":[216],"small":[217],"constant":[218],"approximations":[219],"DAGs":[221],"bounded":[223,228,242],"width":[224],"treewidth.":[229],"Interestingly,":[230],"our":[231,249],"techniques":[232],"exact":[236],"hopsets":[237],"hopbound":[239],"$2$":[240],"treewidth":[243],"some":[247],"show":[255],"technical":[256],"connections":[257],"approximating":[259],"sets":[264],"hopsets.":[266]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-10T00:00:00"}