Lower bounds for dynamic connectivity

@inproceedings{Patrascu2004LowerBF,
  title={Lower bounds for dynamic connectivity},
  author={Mihai Patrascu and Erik D. Demaine},
  booktitle={STOC},
  year={2004}
}
We prove an Ω(lg Erik 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 the graph is formed by disjoint paths, and thus also applies to trees and plane graphs. The bound is known to be tight for these restricted cases, proving optimality of these data structures (e. g., Sleator and Tarjan's dynamic trees). Our trade-off is known to be tight for trees, and the best two data structures… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Lower bounds for fully dynamic connectivity problems in graphs

  • M. L. Fredman, M. R. Henzinger
  • Algorithmica
  • 1998
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…