Spectral Sparsification by Deterministic Discrepancy Walk
LC Lau, R Wang, H Zhou - arXiv preprint arXiv:2408.06146, 2024 - arxiv.org
Spectral sparsification and discrepancy minimization are two well-studied areas that are
closely related. Building on recent connections between these two areas, we generalize the" …
closely related. Building on recent connections between these two areas, we generalize the" …
Eulerian Graph Sparsification by Effective Resistance Decomposition
We provide an algorithm that, given an $ n $-vertex $ m $-edge Eulerian graph with
polynomially bounded weights, computes an $\breve {O}(n\log^{2} n\cdot\varepsilon^{-2}) …
polynomially bounded weights, computes an $\breve {O}(n\log^{2} n\cdot\varepsilon^{-2}) …