1. SNAP Stanford network analysis project: wiki-vote dataset. https://snap.stanford.edu/data/wiki-Vote.html. Accessed Mar 2024
2. Bhardwaj, G., Peri, S., Shetty, P.: Brief announcement: non-blocking dynamic unbounded graphs with wait-free snapshot. In: Dolev, S., Schieber, B. (eds.) International Symposium on Stabilizing, Safety, and Security of Distributed Systems, pp. 106–110. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-44274-2_9
3. Brown, T.A.: Reclaiming memory for lock-free data structures: there has to be a better way. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pp. 261–270 (2015)
4. Chatterjee, B., Peri, S., Sa, M., Manogna, K.: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In: International Conference on Principles of Distributed Systems (2021)
5. Chatterjee, B., Peri, S., Sa, M., Singhal, N.: A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. In: ICDCN 2019, Bangalore, India, January 04-07, 2019, pp. 168–177 (2019)