Year: 2018
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Chu, Timothy, Cohen, Michael B., Pachocki, Jakub W., Peng, Richard
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2887445299