1 citations · 4 across the 5 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DC2018★ 1 cited
A Concurrent Unbounded Wait-Free Graph
Sathya Peri, Chandra Kiran Reddy, Muktikanta Sa
In this paper, we propose an efficient concurrent wait-free algorithm to construct an unbounded directed graph for shared memory architecture. To the best of our knowledge that thi…
cs.DC2018★ 1 cited
A Simple and Practical Concurrent Non-blocking Unbounded Graph with Reachability Queries
Bapi Chatterjee, Sathya Peri, Muktikanta Sa +1
Graph algorithms applied in many applications, including social networks, communication networks, VLSI design, graphics, and several others, require dynamic modifications -- additi…
cs.DC2018★ 1 cited
Maintenance of Strongly Connected Component in Shared-memory Graph
Muktikanta Sa
In this paper, we present an on-line fully dynamic algorithm for maintaining strongly connected component of a directed graph in a shared memory architecture. The edges and vertice…