An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs

Marc Tedder, Derek G. Corneil. An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs. In Wolfgang Thomas, Pascal Weil, editors, STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings. Volume 4393 of Lecture Notes in Computer Science, pages 344-355, Springer, 2007. [doi]

@inproceedings{TedderC07,
  title = {An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs},
  author = {Marc Tedder and Derek G. Corneil},
  year = {2007},
  doi = {10.1007/978-3-540-70918-3_30},
  url = {http://dx.doi.org/10.1007/978-3-540-70918-3_30},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/TedderC07},
  cites = {0},
  citedby = {0},
  pages = {344-355},
  booktitle = {STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings},
  editor = {Wolfgang Thomas and Pascal Weil},
  volume = {4393},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-70917-6},
}