{"id":"https://openalex.org/W7166870773","doi":"https://doi.org/10.48550/arxiv.2606.31560","title":"Directed Low Diameter Decomposition for Structured Digraphs","display_name":"Directed Low Diameter Decomposition for Structured Digraphs","publication_year":2026,"publication_date":"2026-06-30","ids":{"openalex":"https://openalex.org/W7166870773","doi":"https://doi.org/10.48550/arxiv.2606.31560"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.31560","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.31560","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.31560","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013702514","display_name":"Shinwoo An","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"An, Shinwoo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139846498","display_name":"Arnold Filtser","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Filtser, Arnold","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.8668000102043152,"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.8668000102043152,"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.039400000125169754,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.03310000151395798,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/directed-graph","display_name":"Directed graph","score":0.6207000017166138},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5480999946594238},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.5407999753952026},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5394999980926514},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.524399995803833},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4921000003814697},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46209999918937683},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.42010000348091125},{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.40380001068115234},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.40299999713897705}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7766000032424927},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7670000195503235},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.6207000017166138},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5480999946594238},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.5407999753952026},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5394999980926514},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.524399995803833},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5034999847412109},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4921000003814697},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46209999918937683},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.42010000348091125},{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.40380001068115234},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.40299999713897705},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.39579999446868896},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.38370001316070557},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.37880000472068787},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.334199994802475},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.31690001487731934},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.3133000135421753},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.30550000071525574},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.30300000309944153},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.301800012588501},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.28839999437332153},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.27790001034736633},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.27639999985694885},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.2676999866962433},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.2621000111103058},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.2524000108242035},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.25220000743865967},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.31560","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.31560","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.31560","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.31560","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Low":[0],"diameter":[1],"decompositions,":[2],"or":[3],"LDDs":[4,54,142],"for":[5,246],"short,":[6],"are":[7,37,61],"a":[8,23,69,75,85,91],"fundamental":[9],"primitive":[10],"in":[11,49,116,143],"the":[12,28,51,95,107,110,117,127,138,168,179,195,199,219,235,239],"design":[13],"of":[14,27,53,78,141,182,198,223,238,242],"efficient":[15],"graph":[16,157,208],"algorithms.":[17],"Roughly":[18],"speaking,":[19],"an":[20,124,162,206],"LDD":[21],"is":[22,68,90,212],"distribution":[24],"over":[25],"partitions":[26],"vertices":[29,36,112],"into":[30,55],"bounded-diameter":[31],"clusters":[32],"such":[33],"that":[34,98,154,194],"nearby":[35],"likely":[38],"to":[39],"be":[40,114],"clustered":[41],"together.":[42],"Recently,":[43],"there":[44,60],"has":[45,84],"been":[46],"growing":[47],"interest":[48],"lifting":[50],"notion":[52],"\\emph{directed":[56],"graphs}.":[57],"In":[58,133],"particular,":[59],"two":[62,111],"natural":[63],"directed":[64,70,119,145,156],"analogues.":[65],"The":[66,88],"first":[67,149],"LDD,":[71,125],"where":[72],"after":[73,106],"removing":[74],"random":[76],"subset":[77],"edges,":[79],"every":[80],"strongly":[81],"connected":[82],"component":[83],"small":[86],"diameter.":[87],"second":[89,190],"quasipartition,":[92],"which":[93,174],"imposes":[94],"stronger":[96],"requirement":[97],"whenever":[99],"one":[100],"vertex":[101],"can":[102],"still":[103],"reach":[104],"another":[105],"edge":[108],"removal,":[109],"must":[113],"close":[115],"original":[118],"metric.":[120],"Every":[121],"quasipartition":[122,180,240],"yields":[123],"but":[126],"converse":[128],"does":[129],"not":[130],"necessarily":[131],"hold.":[132],"this":[134,232],"work,":[135],"we":[136,152,192],"initiate":[137],"systematic":[139],"study":[140],"structured":[144],"graphs.":[146,249],"As":[147,188],"our":[148,189],"main":[150],"result,":[151,191],"show":[153,193],"any":[155],"with":[158,209],"pathwidth":[159],"$\\mathsf{pw}$":[160],"admits":[161],"$(O(\\mathsf{pw}),":[163],"\u0394)$-LDD.":[164],"This":[165,216],"improves":[166,217],"upon":[167,218],"previous":[169],"best-known":[170],"$(2^{O(\\mathsf{pw}^2)},":[171],"\u0394)$-LDD":[172],"construction,":[173],"was":[175],"implicitly":[176],"derived":[177],"from":[178],"result":[181,233],"Salmasi,":[183],"Sidiropoulos,":[184,225],"and":[185,226],"Sridhar":[186,227],"[SODA'19].":[187],"integrality":[196],"gap":[197],"Directed":[200],"Non-Bipartite":[201],"Sparsest-Cut":[202],"LP":[203],"relaxation":[204],"on":[205],"$n$-vertex":[207],"treewidth":[210,248],"$\\mathsf{tw}$":[211],"$O(\\mathsf{tw}":[213],"\\log":[214],"n)$.":[215],"$O(\\mathsf{tw}\\log^2":[220],"n)$":[221],"bound":[222],"M\u00e9moli,":[224],"[ICALP'16,":[228],"Algorithmica'18].":[229],"We":[230],"obtain":[231],"through":[234],"refined":[236],"analysis":[237],"construction":[241],"M\u00e9moli":[243],"et":[244],"al.":[245],"bounded":[247]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-02T00:00:00"}