17 citations · 19 across the 7 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012
Finding Small Sparse Cuts Locally by Random Walk
Tsz Chiu Kwok, Lap Chi Lau
We study the problem of finding a small sparse cut in an undirected graph. Given an undirected graph G=(V,E) and a parameter k <= |E|, the small sparsest cut problem is to find a s…
cs.DS2012★ 2 cited
Fast Matrix Rank Algorithms and Applications
Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau
We consider the problem of computing the rank of an m x n matrix A over a field. We present a randomized algorithm to find a set of r = rank(A) linearly independent columns in Õ(|A…