Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs

Monika Rauch Henzinger, Johannes A. La Poutré. Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs. In Paul G. Spirakis, editor, Algorithms - ESA 95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings. Volume 979 of Lecture Notes in Computer Science, pages 171-184, Springer, 1995.

@inproceedings{HenzingerP95,
  title = {Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs},
  author = {Monika Rauch Henzinger and Johannes A. La Poutré},
  year = {1995},
  tags = {graph-rewriting, certification, rewriting},
  researchr = {https://researchr.org/publication/HenzingerP95},
  cites = {0},
  citedby = {0},
  pages = {171-184},
  booktitle = {Algorithms - ESA  95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings},
  editor = {Paul G. Spirakis},
  volume = {979},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-60313-1},
}