Cell-Probe Lower Bound for Accessible Interval Graphs

Sankardeep Chakraborty, Christian Engels, Seungbum Jo +1

We spot a hole in the area of succinct data structures for graph classes from a universe of size at most $n^n$. Very often, the input graph is labeled by the user in an arbitrary a…