Efficient parallel algorithms for betweenness- and closeness-centrality in dynamic graphs

Kshitij Shukla, Sai Charan Regunta, Sai Harsh Tondomker, Kishore Kothapalli. Efficient parallel algorithms for betweenness- and closeness-centrality in dynamic graphs. In Eduard Ayguadé, Wen-mei W. Hwu, Rosa M. Badia, H. Peter Hofstee, editors, ICS '20: 2020 International Conference on Supercomputing, Barcelona Spain, June, 2020. ACM, 2020. [doi]

@inproceedings{ShuklaRTK20,
  title = {Efficient parallel algorithms for betweenness- and closeness-centrality in dynamic graphs},
  author = {Kshitij Shukla and Sai Charan Regunta and Sai Harsh Tondomker and Kishore Kothapalli},
  year = {2020},
  url = {https://dl.acm.org/doi/10.1145/3392717.3392743},
  researchr = {https://researchr.org/publication/ShuklaRTK20},
  cites = {0},
  citedby = {0},
  booktitle = {ICS '20: 2020 International Conference on Supercomputing, Barcelona Spain, June, 2020},
  editor = {Eduard Ayguadé and Wen-mei W. Hwu and Rosa M. Badia and H. Peter Hofstee},
  publisher = {ACM},
  isbn = {978-1-4503-7983-0},
}