Super-Logarithmic Lower Bounds for Dynamic Graph Problems

被引：0
|
作者：
Larsen, Kasper Green [1 ]
Yu, Huacheng [2 ]
机构：
[1] Aarhus Univ, Aarhus, Denmark
[2] Princeton Univ, Princeton, NJ USA
来源：
2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS | 2023年
关键词：
cell-probe model; data structure lower bounds; dynamic reachability; dynamic graph algorithms; TIME;
D O I：
10.1109/FOCS57990.2023.00096
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this work, we prove a (Omega) over tilde (lg(3/2) n) unconditional lower bound on the maximum of the query time and update time for dynamic data structures supporting reachability queries in n-node directed acyclic graphs under edge insertions. This is the first super-logarithmic lower bound for any natural graph problem. In proving the lower bound, we also make novel contributions to the state-of-the-art data structure lower bound techniques that we hope may lead to further progress in proving lower bounds.
引用
收藏
页码：1589 / 1604
页数：16
相关论文
共 50 条
12345