no code implementations • 14 Dec 2020 • Christian Elbracht, Jan Kurkofka, Maximilian Teegen
We show that every graph admits a canonical tree-like decomposition into its $k$-edge-connected pieces for all $k\in\mathbb{N}\cup\{\infty\}$ simultaneously.
Combinatorics Discrete Mathematics 05C40 (Primary), 05C05, 05C69, 05C70, 05C83, 05C63 (Secondary)
1 code implementation • 25 Jun 2020 • Solveig Klepper, Christian Elbracht, Diego Fioravanti, Jakob Kneip, Luca Rendsburg, Maximilian Teegen, Ulrike Von Luxburg
Given a collection of cuts of any dataset, tangles aggregate these cuts to point in the direction of a dense structure.