Daniel Agassy

most citedImproved Tree Sparsifiers in Near-Linear Time

1 citations · 1 across the 2 of their papers we have counts for

collaborators

3 papers

cs.DS2025

Expander Decomposition for Non-Uniform Vertex Measures

Daniel Agassy, Dani Dorfman, Haim Kaplan

A $(ϕ, ε)$ -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 $Φ (G [V_{i}]) \geq ϕ$ , such that…

cs.DS2025★ 1 cited

Improved Tree Sparsifiers in Near-Linear Time

Daniel Agassy, Dani Dorfman, Haim Kaplan

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

cs.DS2022

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

Daniel Agassy, Dani Dorfman, Haim Kaplan