Tangles and Hierarchical Clustering
From MaRDI portal
Publication:6187073
DOI10.1137/22m1484936OpenAlexW4390613349MaRDI QIDQ6187073
Publication date: 10 January 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/22m1484936
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tangles, tree-decompositions and grids in matroids
- Graph minors. X: Obstructions to tree-decomposition
- Profiles of separations: in graphs, matroids, and beyond
- Hypertree width and related hypergraph invariants
- Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)
- A cost function for similarity-based hierarchical clustering
This page was built for publication: Tangles and Hierarchical Clustering