32 citations · 74 across the 12 of their papers we have counts for
Showing 2016 · cs.DSShow all
2 papers · 2 filters
cs.DS2016★ 4 cited
Work-Efficient Parallel and Incremental Graph Connectivity
Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura +1
On an evolving graph that is continuously updated by a high-velocity stream of edges, how can one efficiently maintain if two vertices are connected? This is the connectivity probl…
cs.DS2016
Incremental Maintenance of Maximal Cliques in a Dynamic Graph
Apurba Das, Michael Svendsen, Srikanta Tirthapura
We consider the maintenance of the set of all maximal cliques in a dynamic graph that is changing through the addition or deletion of edges. We present nearly tight bounds on the m…