{"author":[{"id":"0a01c7b2-b823-11ed-9928-cc3f874f9ffd","full_name":"Hahn, Niklas","first_name":"Niklas","last_name":"Hahn"},{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Stefankovic, Zofia","first_name":"Zofia","last_name":"Stefankovic"}],"ec_funded":1,"language":[{"iso":"eng"}],"department":[{"_id":"MoHe"}],"researchdata_availability":"no","date_updated":"2026-09-09T11:55:47Z","publisher":"Elsevier","date_created":"2026-09-06T22:01:55Z","fulldoi":"https://doi.org/10.1016/j.ipl.2026.106663","citation":{"ista":"Hahn N, Henzinger M, Stefankovic Z. 2026. Tight bounds on the performance of dynamic directed cutset data structures based on OMv. Information Processing Letters. 195, 106663.","ieee":"N. Hahn, M. Henzinger, and Z. Stefankovic, “Tight bounds on the performance of dynamic directed cutset data structures based on OMv,” Information Processing Letters, vol. 195. Elsevier, 2026.","ama":"Hahn N, Henzinger M, Stefankovic Z. Tight bounds on the performance of dynamic directed cutset data structures based on OMv. Information Processing Letters. 2026;195. doi:10.1016/j.ipl.2026.106663","apa":"Hahn, N., Henzinger, M., & Stefankovic, Z. (2026). Tight bounds on the performance of dynamic directed cutset data structures based on OMv. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2026.106663","short":"N. Hahn, M. Henzinger, Z. Stefankovic, Information Processing Letters 195 (2026).","chicago":"Hahn, Niklas, Monika Henzinger, and Zofia Stefankovic. “Tight Bounds on the Performance of Dynamic Directed Cutset Data Structures Based on OMv.” Information Processing Letters. Elsevier, 2026. https://doi.org/10.1016/j.ipl.2026.106663.","mla":"Hahn, Niklas, et al. “Tight Bounds on the Performance of Dynamic Directed Cutset Data Structures Based on OMv.” Information Processing Letters, vol. 195, 106663, Elsevier, 2026, doi:10.1016/j.ipl.2026.106663."},"intvolume":" 195","article_type":"original","scopus_import":"1","title":"Tight bounds on the performance of dynamic directed cutset data structures based on OMv","keyword":["Dynamic algorithms","Graph algorithms","Directed graphs","Lower bounds","Upper bounds"],"OA_type":"closed access","date_published":"2026-08-30T00:00:00Z","acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413 and from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) Image 1 dummy alt text. Zofia Stefankovic was partially supported by the ISTernship program of the Institute of Science and Technology Austria and OEAD.","status":"public","type":"journal_article","year":"2026","_id":"22812","article_number":"106663","publication_identifier":{"issn":["0020-0190"]},"article_processing_charge":"No","quality_controlled":"1","month":"08","project":[{"grant_number":"101034413","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"},{"grant_number":"101019564","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"}],"publication_status":"epub_ahead","supplementarymaterial":"no","dataavailabilitystatement":"No data was used for the research described in the article.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","das_tickbox":"1","abstract":[{"text":"Efficient data structures for computing the cutset of a set of nodes in a graph undergoing dynamic edge insertions/deletions are well-studied in undirected graphs. We study this problem in directed graphs and show a reduction from the Online Boolean Matrix-Vector Multiplication Conjecture (OMv) introduced by Henzinger et al. [STOC’15]. We prove conditional on OMv that a dynamic data structure computing the directed cutset of a set of nodes cannot have an amortized time of both O(n2−ε) for a query operation and O(n1−ε) for an update operation, for any constant ε > 0, even when an adversary’s operations are restricted to the incremental or decremental settings. We further give algorithms to match these lower bounds.","lang":"eng"}],"volume":195,"publication":"Information Processing Letters","day":"30","doi":"10.1016/j.ipl.2026.106663"}