2 citations · 4 across the 8 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems
Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti
This short note provides space-efficient linear time algorithms for computing bridges, topological sorting, and strongly connected components improving on several recent results of…
cs.DS2017
Frameworks for Designing In-place Graph Algorithms
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman +1
Read-only memory model is a classical model of computation to study time-space tradeoffs of algorithms. One of the classical results on the ROM model is that any sorting algorithm…