Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds LIPIcs Chatterjee, Bapi ; https://orcid.org/0000-0002-2742-4028 Peri, Sathya Sa, Muktikanta ddc:000 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. Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021 info:eu-repo/semantics/conferenceObject doc-type:conferenceObject conferenceObject http://purl.org/coar/resource_type/c_5794 https://research-explorer.ista.ac.at/record/10216 https://research-explorer.ista.ac.at/download/10216/10276 Chatterjee B, Peri S, Sa M. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In: <i>35th International Symposium on Distributed Computing</i>. Vol 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href="https://doi.org/10.4230/LIPIcs.DISC.2021.52">10.4230/LIPIcs.DISC.2021.52</a> eng info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.DISC.2021.52 info:eu-repo/semantics/altIdentifier/issn/1868-8969 info:eu-repo/semantics/altIdentifier/isbn/9-783-9597-7210-5 info:eu-repo/semantics/altIdentifier/arxiv/2003.01697 https://creativecommons.org/licenses/by/4.0/ info:eu-repo/semantics/openAccess