On Dasgupta's hierarchical clustering objective and its relation to other graph parameters
From MaRDI portal
Publication:2140508
DOI10.1007/978-3-030-86593-1_20OpenAlexW3202470222MaRDI QIDQ2140508FDOQ2140508
Jan Arne Telle, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Svein Høgemo
Publication date: 20 May 2022
Full work available at URL: https://arxiv.org/abs/2105.12093
Cites Work
- Optimal node ranking of trees
- Tree-depth, subgraph coloring and homomorphism bounds
- Rankings of Graphs
- On an edge ranking problem of trees and graphs
- Quasi-threshold graphs
- Optimal node ranking of tree in linear time
- Graph Theory
- Computing the Minimum Fill-In is NP-Complete
- Title not available (Why is that?)
- Optimal edge ranking of trees in polynomial time
- Improved approximation algorithms for the average-case tree searching problem
- On the complexity of searching in trees and partially ordered structures
- Edge ranking of graphs is hard
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- Optimal edge ranking of trees in linear time
- On low tree-depth decompositions
- Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics
- Title not available (Why is that?)
- A cost function for similarity-based hierarchical clustering
- Hierarchical Clustering
- Hierarchical Clustering better than Average-Linkage
- Title not available (Why is that?)
- New hardness results for planar graph problems in p and an algorithm for sparsest cut
This page was built for publication: On Dasgupta's hierarchical clustering objective and its relation to other graph parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140508)
