A simple and practical concurrent non-blocking unbounded graph with linearizable reachability qeries

Bapi Chatterjee, Sathya Peri, Muktikanta Sa, Nandini Singhal. A simple and practical concurrent non-blocking unbounded graph with linearizable reachability qeries. In R. C. Hansdah, Dilip Krishnaswamy, Nitin Vaidya, editors, Proceedings of the 20th International Conference on Distributed Computing and Networking, ICDCN 2019, Bangalore, India, January 04-07, 2019. pages 168-177, ACM, 2019. [doi]

Abstract

Abstract is missing.