{"id":"https://openalex.org/W7140188378","doi":"https://doi.org/10.48550/arxiv.2603.22063","title":"On the Complexity of Fundamental Problems for DAG-Compressed Graphs","display_name":"On the Complexity of Fundamental Problems for DAG-Compressed Graphs","publication_year":2026,"publication_date":"2026-03-23","ids":{"openalex":"https://openalex.org/W7140188378","doi":"https://doi.org/10.48550/arxiv.2603.22063"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.22063","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.22063","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":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.22063","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Chudigiewitsch, Florian","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chudigiewitsch, Florian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Tantau, Till","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tantau, Till","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Winkler, Felix","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Winkler, Felix","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"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/T11269","display_name":"Algorithms and Data Compression","score":0.2964000105857849,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.2964000105857849,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.29339998960494995,"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/T11106","display_name":"Data Management and Algorithms","score":0.06430000066757202,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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-acyclic-graph","display_name":"Directed acyclic graph","score":0.7445999979972839},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5141000151634216},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4839000105857849},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.4575999975204468},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.44589999318122864},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4253999888896942},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.38909998536109924},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.3605000078678131}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.7445999979972839},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5141000151634216},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49399998784065247},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4839000105857849},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.4575999975204468},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.44589999318122864},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4327000081539154},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4253999888896942},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4068000018596649},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40459999442100525},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.38909998536109924},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3643999993801117},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3605000078678131},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34940001368522644},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.3418000042438507},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3330000042915344},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3257000148296356},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.31690001487731934},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3102000057697296},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.30869999527931213},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2971000075340271},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29670000076293945},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.2962999939918518},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2766000032424927},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.27639999985694885},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.25440001487731934}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.22063","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.22063","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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.22063","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.22063","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":"article"},"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":{"A":[0],"DAG":[1,55,67,147,171,195],"compression":[2,68,172,196],"of":[3,28,113,124],"a":[4,9,32,45,169,174,199],"(typically":[5,110],"dense)":[6],"graph":[7,35,99],"is":[8,106,128,166,178,182,202],"simple":[10,75],"data":[11],"structure":[12],"that":[13,54,73,87,132],"stores":[14],"how":[15,163],"vertex":[16],"clusters":[17,22,43],"are":[18,23],"connected,":[19],"where":[20,41,126,190],"the":[21,42,51,71,92,97,104,109,114,122,150,155,184,187,194,207],"described":[24],"indirectly":[25],"as":[26],"sets":[27],"reachable":[29],"sinks":[30],"in":[31,66,206],"directed":[33],"acyclic":[34],"(DAG).":[36],"They":[37],"generalize":[38],"tree":[39,62],"compressions,":[40],"form":[44],"tree-like":[46],"hierarchy,":[47],"and":[48,100,180],"we":[49,153,191],"give":[50],"first":[52],"proof":[53],"compressions":[56,60],"can":[57,83,140],"achieve":[58],"better":[59],"than":[61,95],"compressions.":[63,148],"Our":[64],"interest":[65],"stems":[69],"from":[70,159],"fact":[72],"several":[74],"standard":[76],"algorithms,":[77],"like":[78],"breadth-first":[79],"search":[80],"on":[81,91,96,146],"graphs,":[82],"be":[84,141],"implemented":[85],"so":[86,101],"they":[88],"work":[89,144],"directly":[90,145],"compressed":[93,115],"rather":[94],"original":[98],"that,":[102],"crucially,":[103],"runtime":[105],"relative":[107],"to":[108,121,143,167],"small)":[111],"size":[112],"graph.":[116,209],"We":[117],"add":[118],"another":[119],"entry":[120],"list":[123],"algorithms":[125],"this":[127,181],"possible,":[129],"by":[130],"showing":[131],"Kruskal's":[133],"algorithm":[134],"for":[135,173,186],"computing":[136],"minimum":[137],"spanning":[138],"trees":[139],"adapted":[142],"On":[149],"negative":[151],"side,":[152],"answer":[154],"central":[156],"open":[157],"problem":[158],"previous":[160],"work,":[161],"namely":[162],"hard":[164],"it":[165],"compute":[168],"minimum-size":[170],"given":[175],"graph:":[176],"This":[177],"NP-hard;":[179],"even":[183],"case":[185],"dynamic":[188],"setting,":[189],"must":[192],"update":[193],"optimally":[197],"when":[198],"single":[200],"edge":[201],"added":[203],"or":[204],"deleted":[205],"input":[208]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-25T00:00:00"}