R. Hariharan

most citedA Linear-time Algorithm for Sparsification of Unweighted Graphs

2 citations · 5 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DS2010★ 2 cited

A Linear-time Algorithm for Sparsification of Unweighted Graphs

Ramesh Hariharan, Debmalya Panigrahi

Given an undirected graph $G$ and an error parameter $ε > 0$ , the {\em graph sparsification} problem requires sampling edges in $G$ and giving the sampled edges appropriate weights…

cs.DS2010★ 2 cited

A General Framework for Graph Sparsification

Ramesh Hariharan, Debmalya Panigrahi

Given a weighted graph $G$ and an error parameter $ε > 0$ , the {\em graph sparsification} problem requires sampling edges in $G$ and giving the sampled edges appropriate weights to…

quant-ph2000★ 1 cited

String Matching in $O ~ (n + m)$ Quantum Time

H. Ramesh, V. Vinay

We show how to determine whether a given pattern p of length m occurs in a given text t of length n in $O ~ (n + m)$ \footnote{ $O ~$ allows for logarithmic…

A Linear-time Algorithm for Sparsification of Unweighted Graphs

A General Framework for Graph Sparsification

String Matching in O~(n​+m​) Quantum Time

String Matching in $O ~ (n + m)$ Quantum Time