Super-Logarithmic Lower Bounds for Dynamic Graph Problems

by   Kasper Green Larsen, et al.

In this work, we prove a Ω̃(^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.


page 1

page 2

page 3

page 4


Stronger 3SUM-Indexing Lower Bounds

The 3SUM-Indexing problem was introduced as a data structure version of ...

Further Unifying the Landscape of Cell Probe Lower Bounds

In a landmark paper, Pǎtraşcu demonstrated how a single lower bound for ...

Lower Bounds for Oblivious Near-Neighbor Search

We prove an Ω(d n/ ( n)^2) lower bound on the dynamic cell-probe comple...

Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs

A dynamic graph algorithm is a data structure that answers queries about...

An Optimal Lower Bound for Simplex Range Reporting

We give a simplified and improved lower bound for the simplex range repo...

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements

The k-dimensional Weisfeiler-Leman (k-WL) algorithm is a simple combinat...

Stronger Lower Bounds for Online ORAM

Oblivious RAM (ORAM), introduced in the context of software protection b...

Please sign up or login with your details

Forgot password? Click here to reset