Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs

Shahbaz Khan 0004. Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs. In Christian Scheideler, Mohammad Taghi Hajiaghayi, editors, Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. pages 283-292, ACM, 2017. [doi]

@inproceedings{Khan17-7,
  title = {Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs},
  author = {Shahbaz Khan 0004},
  year = {2017},
  doi = {10.1145/3087556.3087576},
  url = {http://doi.acm.org/10.1145/3087556.3087576},
  researchr = {https://researchr.org/publication/Khan17-7},
  cites = {0},
  citedby = {0},
  pages = {283-292},
  booktitle = {Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017},
  editor = {Christian Scheideler and Mohammad Taghi Hajiaghayi},
  publisher = {ACM},
  isbn = {978-1-4503-4593-4},
}