{"id":"https://openalex.org/W4416380191","doi":"https://doi.org/10.4230/lipics.icalp.2025.92","title":"Fully Dynamic Algorithms for Transitive Reduction","display_name":"Fully Dynamic Algorithms for Transitive Reduction","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4416380191","doi":"https://doi.org/10.4230/lipics.icalp.2025.92"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2504.18161","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.18161","pdf_url":"https://arxiv.org/pdf/2504.18161","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2504.18161","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078315645","display_name":"Gramoz Goranci","orcid":"https://orcid.org/0000-0002-9603-2255"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Goranci, Gramoz","raw_affiliation_strings":["Faculty of Computer Science, University of Vienna, Austria"],"raw_orcid":"https://orcid.org/0000-0002-9603-2255","affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, University of Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088982819","display_name":"Adam Karczmarz","orcid":"https://orcid.org/0000-0002-2693-8713"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Karczmarz, Adam","raw_affiliation_strings":["University of Warsaw, Poland"],"raw_orcid":"https://orcid.org/0000-0002-2693-8713","affiliations":[{"raw_affiliation_string":"University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079275314","display_name":"Ali Momeni","orcid":"https://orcid.org/0000-0001-9707-8290"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Momeni, Ali","raw_affiliation_strings":["Faculty of Computer Science, UniVie Doctoral School Computer Science DoCS, University of Vienna, Austria"],"raw_orcid":"https://orcid.org/0009-0009-8280-7847","affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, UniVie Doctoral School Computer Science DoCS, University of Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062582508","display_name":"Nikos Parotsidis","orcid":"https://orcid.org/0000-0003-3888-7391"},"institutions":[{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Parotsidis, Nikos","raw_affiliation_strings":["Google Research, Z\u00fcrich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-3888-7391","affiliations":[{"raw_affiliation_string":"Google Research, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I4210100430"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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.7368999719619751,"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.7368999719619751,"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.1729000061750412,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.01850000023841858,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/transitive-reduction","display_name":"Transitive reduction","score":0.8465999960899353},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8245999813079834},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.730400025844574},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.6080999970436096},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.5812000036239624},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5616999864578247},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4975999891757965},{"id":"https://openalex.org/keywords/graph-reduction","display_name":"Graph reduction","score":0.4864000082015991},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4611000120639801}],"concepts":[{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.8465999960899353},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8245999813079834},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.730400025844574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6141999959945679},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.6080999970436096},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5924999713897705},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.5812000036239624},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5616999864578247},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49880000948905945},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4975999891757965},{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.4864000082015991},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4611000120639801},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41940000653266907},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4156999886035919},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3917999863624573},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.3896999955177307},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3693999946117401},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.358599990606308},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3547999858856201},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.35280001163482666},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3179999887943268},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.2824000120162964},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2676999866962433},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.2630000114440918},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.26260000467300415},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26080000400543213},{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.2549000084400177},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25209999084472656},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:2504.18161","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.18161","pdf_url":"https://arxiv.org/pdf/2504.18161","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2504.18161","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2504.18161","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"},{"id":"doi:10.4230/lipics.icalp.2025.92","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2025.92","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2504.18161","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.18161","pdf_url":"https://arxiv.org/pdf/2504.18161","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320335039","display_name":"Narodowe Centrum Bada\u0144 i Rozwoju","ror":"https://ror.org/05pwfyy15"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416380191.pdf","grobid_xml":"https://content.openalex.org/works/W4416380191.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,5,20,60,64,103],"directed":[2,66,91],"graph":[3,67],"$G$,":[4],"transitive":[6,45,61],"reduction":[7,46,62],"$G^t$":[8],"of":[9,23,44,63,105,118],"$G$":[10,24],"(first":[11],"studied":[12],"by":[13],"Aho,":[14],"Garey,":[15],"Ullman":[16],"[SICOMP":[17],"`72])":[18],"is":[19,87],"minimal":[21],"subgraph":[22],"that":[25],"preserves":[26],"the":[27,41,48,53,110],"reachability":[28],"relation":[29],"between":[30],"every":[31],"two":[32],"vertices":[33],"in":[34,47],"$G$.":[35],"In":[36],"this":[37],"paper,":[38],"we":[39],"study":[40],"computational":[42],"complexity":[43],"dynamic":[49,56],"setting.":[50],"We":[51],"obtain":[52],"first":[54,77],"fully":[55],"algorithms":[57],"for":[58,89],"maintaining":[59],"general":[65],"undergoing":[68],"updates":[69],"such":[70,100],"as":[71,101],"edge":[72],"insertions":[73],"or":[74,113],"deletions.":[75],"Our":[76,120],"algorithm":[78,122],"achieves":[79,129],"$O(m+n":[80],"\\log":[81],"n)$":[82],"amortized":[83],"update":[84,98,133],"time,":[85],"which":[86],"near-optimal":[88],"sparse":[90],"graphs,":[92],"and":[93,128],"can":[94],"even":[95],"support":[96],"extended":[97],"operations":[99],"inserting":[102],"set":[104,117],"edges":[106],"all":[107],"incident":[108],"to":[109],"same":[111],"vertex,":[112],"deleting":[114],"an":[115],"arbitrary":[116],"edges.":[119],"second":[121],"relies":[123],"on":[124],"fast":[125],"matrix":[126],"multiplication":[127],"$O(m+":[130],"n^{1.585})$":[131],"\\emph{worst-case}":[132],"time.":[134]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}