5 papers
Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery
Hanno von Bergen, Larissa Fastenau, Enna Gerhard +8
We study solution discovery, where the goal is to obtain a feasible solution to a problem from an initial configuration by a bounded sequence of local moves. In many applications,…
Tangle structure trees
Hanno von Bergen, Reinhard Diestel
We introduce a comprehensive data structure, tangle structure trees, which simultaneously displays all the -tangles of an abstract separation system for very general o…
Tangle structure trees II: trees of tangles and tangle-tree duality
Hanno von Bergen, Reinhard Diestel
Tangle structure trees, introduced in [3], offer a unified data structure that displays all the tangles of a graph or data set together with certificates for the non-existence of a…
Traits and tangles: An analysis of the Big Five paradigm by tangle-based clustering
Hanno von Bergen, Reinhard Diestel
Using the recently developed mathematical theory of tangles, we re-assess the mathematical foundations for applications of the five factor model in personality tests by a new, math…
On vertex sets inducing tangles
Sandra Albrechtsen, Hanno von Bergen, Raphael W. Jacobs +2
Diestel, Hundertmark and Lemanczyk asked whether every -tangle in a graph is induced by a set of vertices by majority vote. We reduce their question to graphs whose size is boun…