@InProceedings{chatterjee_et_al:LIPIcs.DISC.2021.52,
  author =	{Chatterjee, Bapi and Peri, Sathya and Sa, Muktikanta},
  title =	{{Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds}},
  booktitle =	{35th International Symposium on Distributed Computing (DISC 2021)},
  pages =	{52:1--52:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-210-5},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{209},
  editor =	{Gilbert, Seth},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.52},
  URN =		{urn:nbn:de:0030-drops-148549},
  doi =		{10.4230/LIPIcs.DISC.2021.52},
  annote =	{Keywords: concurrent data structure, linearizability, non-blocking, directed graph, breadth-first search, single-source shortest-path, betweenness centrality}
}