Constant Arboricity Spectral Sparsifiers
Data Structures and Algorithms
2018-08-20 v1
Abstract
We show that every graph is spectrally similar to the union of a constant number of forests. Moreover, we show that Spielman-Srivastava sparsifiers are the union of O(logn) forests. This result can be used to estimate boundaries of small subsets of vertices in nearly optimal query time.
Cite
@article{arxiv.1808.05662,
title = {Constant Arboricity Spectral Sparsifiers},
author = {Timothy Chu and Michael B. Cohen and Jakub W. Pachocki and Richard Peng},
journal= {arXiv preprint arXiv:1808.05662},
year = {2018}
}