@inproceedings{10216,
  abstract     = {This paper reports a new concurrent graph data structure that supports updates of both edges and vertices and queries: Breadth-first search, Single-source shortest-path, and Betweenness centrality. The operations are provably linearizable and non-blocking.},
  author       = {Chatterjee, Bapi and Peri, Sathya and Sa, Muktikanta},
  booktitle    = {35th International Symposium on Distributed Computing},
  isbn         = {9-783-9597-7210-5},
  issn         = {1868-8969},
  location     = {Freiburg, Germany},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds}},
  doi          = {10.4230/LIPIcs.DISC.2021.52},
  volume       = {209},
  year         = {2021},
}