5 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.DS2022★ 1 cited
Space Optimal Vertex Cover in Dynamic Streams
Kheeran K. Naidu, Vihan Shah
We optimally resolve the space complexity for the problem of finding an -approximate minimum vertex cover (MVC) in dynamic graph streams. We give a randomised algorithm for $…
cs.DS2021★ 5 cited
On Two-Pass Streaming Algorithms for Maximum Bipartite Matching
Christian Konrad, Kheeran K. Naidu
We study two-pass streaming algorithms for Maximum Bipartite Matching (MBM). All known two-pass streaming algorithms for MBM operate in a similar fashion: They compute a maximal ma…