On Dasgupta's hierarchical clustering objective and its relation to other graph parameters

DOI10.1007/978-3-030-86593-1_20MaRDI QIDQ2140508zbMATH OpenOpenAlexFDO

Authors Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle

Publication date 20 May 2022

Full work available at URL https://arxiv.org/abs/2105.12093

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1414315 (Why is no real title available?)
• scientific article; zbMATH DE number 7559418 (Why is no real title available?)
• A cost function for similarity-based hierarchical clustering
• Approximate hierarchical clustering via sparsest cut and spreading metrics
• Computing the Minimum Fill-In is NP-Complete
• Edge ranking of graphs is hard
• Graph theory
• Hierarchical clustering better than average-linkage
• Hierarchical clustering via spreading metrics
• Hierarchical clustering. Objective functions and algorithms
• Improved approximation algorithms for the average-case tree searching problem
• New hardness results for planar graph problems in p and an algorithm for sparsest cut
• On an edge ranking problem of trees and graphs
• On low tree-depth decompositions
• On the complexity of searching in trees and partially ordered structures
• On the vertex ranking problem for trapezoid, circular-arc and other graphs
• Optimal edge ranking of trees in linear time
• Optimal edge ranking of trees in polynomial time
• Optimal node ranking of tree in linear time
• Optimal node ranking of trees
• Quasi-threshold graphs
• Rankings of Graphs
• Tree-depth, subgraph coloring and homomorphism bounds

Cited in

(1)

• Tight approximation bounds on a simple algorithm for minimum average search time in trees

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)