Randomization for Efficient Dynamic Graph Algorithms - (Invited Talk)

Surender Baswana. Randomization for Efficient Dynamic Graph Algorithms - (Invited Talk). In Sathish Govindarajan, Anil Maheshwari, editors, Algorithms and Discrete Applied Mathematics - Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings. Volume 9602 of Lecture Notes in Computer Science, pages 1-13, Springer, 2016. [doi]

@inproceedings{Baswana16,
  title = {Randomization for Efficient Dynamic Graph Algorithms - (Invited Talk)},
  author = {Surender Baswana},
  year = {2016},
  doi = {10.1007/978-3-319-29221-2_1},
  url = {http://dx.doi.org/10.1007/978-3-319-29221-2_1},
  researchr = {https://researchr.org/publication/Baswana16},
  cites = {0},
  citedby = {0},
  pages = {1-13},
  booktitle = {Algorithms and Discrete Applied Mathematics - Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings},
  editor = {Sathish Govindarajan and Anil Maheshwari},
  volume = {9602},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-29220-5},
}