12 citations · 42 across the 21 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2015★ 2 cited
Approximate Spectral Clustering: Efficiency and Guarantees
Pavel Kolev, Kurt Mehlhorn
Approximate Spectral Clustering (ASC) is a popular and successful heuristic for partitioning the nodes of a graph into clusters for which the ratio of outside connections compa…
cs.DM2015★ 2 cited
An Efficient Parallel Algorithm for Spectral Sparsification of Laplacian and SDDM Matrix Polynomials
Gorav Jindal, Pavel Kolev
For "large" class of continuous probability density functions (p.d.f.), we demonstrate that for every there is mixture of discrete Binomial distribu…