@InProceedings{chatterjee_et_al:LIPIcs.OPODIS.2021.20,
author = {Chatterjee, Bapi and Peri, Sathya and Sa, Muktikanta and Manogna, Komma},
title = {{Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds}},
booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)},
pages = {20:1--20:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-219-8},
ISSN = {1868-8969},
year = {2022},
volume = {217},
editor = {Bramas, Quentin and Gramoli, Vincent and Milani, Alessia},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.20},
URN = {urn:nbn:de:0030-drops-157952},
doi = {10.4230/LIPIcs.OPODIS.2021.20},
annote = {Keywords: concurrent data structure, linearizability, non-blocking, directed graph, breadth-first search, single-source shortest-path, betweenness centrality}
}