2 citations · 4 across the 8 of their papers we have counts for
5 papers · 1 filter
Enumerating Range Modes
Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane +1
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. We give time- and space- efficient alg…
Optimal In-place Algorithms for Basic Graph Problems
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-fi…
Space Efficient Algorithms for Breadth-Depth Search
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. Both these search methods share the same name {\i…
Indexing Graph Search Trees and Applications
Sankardeep Chakraborty, Kunihiko Sadakane
We consider the problem of compactly representing the Depth First Search (DFS) tree of a given undirected or directed graph having vertices and edges while supporting vario…
Succinct Data Structures for Families of Interval Graphs
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo +1
We consider the problem of designing succinct data structures for interval graphs with vertices while supporting degree, adjacency, neighborhood and shortest path queries in op…