no code implementations • 25 Jul 2019 • Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
We consider the range mode problem where given a sequence and a query range in it, we want to find items with maximum frequency in the range.
no code implementations • 22 Jul 2019 • Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
We present linear time {\it in-place} algorithms for several basic and fundamental graph problems including the well-known graph search methods (like depth-first search, breadth-first search, maximum cardinality search), connectivity problems (like biconnectivity, $2$-edge connectivity), decomposition problem (like chain decomposition) among various others, improving the running time (by polynomial multiplicative factor) of the recent results of Chakraborty et al. [ESA, 2018] who designed $O(n^3 \lg n)$ time in-place algorithms for a strict subset of the above mentioned problems.
no code implementations • 19 Jun 2019 • Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti
Continuing the recent trend, in this article we design several space-efficient algorithms for two well-known graph search methods.
