261 search results - page 53 / 53 » An Optimization Technique for Answering Regular Path Queries |
STOC
2004
ACM
14 years 10 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...