Daniel Agassy

cs.DS2026

Improved Tree Sparsifiers in Near-Linear Time

Daniel Agassy, Dani Dorfman, Haim Kaplan

A \emph{tree cut-sparsifier} $T$ of quality $I^\pm$ of a graph $G$ is a single tree that preserves the capacities of all cuts in the graph up to a factor of $I^\pm$ . A \emph{tree flow-sp…

cs.DS2025

Expander Decomposition for Non-Uniform Vertex Measures

Daniel Agassy, Dani Dorfman, Haim Kaplan

A $(I ¨ , I^µ)$ -expander-decomposition of a graph $G$ (with $n$ vertices and $m$ edges) is a partition of $V$ into clusters $V_{1}, \dots, V_{k}$ with conductance $I^¦ (G [V_{i}]) \geq I ¨ $ , such…

cs.DS2025

Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player

Daniel Agassy, Dani Dorfman, Haim Kaplan

A $(I ¨ , I^µ)$ -expander-decomposition of a graph $G$ (with $n$ vertices and $m$ edges) is a partition of $V$ into clusters $V_{1}, \dots, V_{k}$ with conductance $I^¦ (G [V_{i}]) \geq I ¨ $ , such…