18 citations · 45 across the 11 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DS2018★ 4 cited
Nearly Optimal Space Efficient Algorithm for Depth First Search
Jayesh Choudhari, Manoj Gupta, Shivdutt Sharma
We design a space-efficient algorithm for performing depth-first search traversal(DFS) of a graph in time using bits of space. While a normal DFS algorithm…
cs.DS2018
Generic Single Edge Fault Tolerant Exact Distance Oracle
Manoj Gupta, Aditi Singh
Given an undirected unweighted graph and a source set of sources, we want to build a data structure which can process the following query {\sc Q} find t…
cs.DS2018★ 18 cited
Simple dynamic algorithms for Maximal Independent Set and other problems
Manoj Gupta, Shahbaz Khan
Most graphs in real life keep changing with time. These changes can be in the form of insertion or deletion of edges or vertices. Such rapidly changing graphs motivate us to study…