13 citations · 28 across the 11 of their papers we have counts for
4 papers · 1 filter
A canonical tree-of-tangles theorem for structurally submodular separation systems
Christian Elbracht, Jay Lilian Kneip
We show that every structurally submodular separation system admits a canonical tree set which distinguishes its tangles.
Clustering with Tangles: Algorithmic Framework and Theoretical Guarantees
Solveig Klepper, Christian Elbracht, Diego Fioravanti +4
Originally, tangles were invented as an abstract tool in mathematical graph theory to prove the famous graph minor theorem. In this paper, we showcase the practical potential of ta…
A Note on Generic Tangle Algorithms
Christian Elbracht, Jay Lilian Kneip, Maximilian Teegen
In this note we gather the theoretical outlines of three basic algorithms for tangles in abstract separation systems: a naive tree search for finding tangles; an algorithm which ou…
Trees of tangles in infinite separation systems
Christian Elbracht, Jay Lilian Kneip, Maximilian Teegen
We present infinite analogues of our splinter lemma from [Trees of tangles in abstract separation systems, arXiv:1909.09030]. From these we derive several tree-of-tangles-type theo…