From hypertrees to arboreal quasi-ultrametrics

DOI10.1016/j.dam.2004.06.017zbMath1056.05102OpenAlexW2129831965MaRDI QIDQ1766738

François Brucker

Publication date: 8 March 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.06.017

zbMATH Keywords

clusteringdissimilarityhypertreesubdominantball hypergraphcluster hypergraphquasi-ultrametric

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Metric spaces, metrizability (54E35) Distance in graphs (05C12)

Related Items

Parsimonious cluster systems ⋮ Combinatorial optimisation and hierarchical classifications ⋮ Totally balanced dissimilarities

Cites Work

• NP-hard problems in hierarchical-tree clustering
• Hypergraphes arbores
• NP-hard approximation problems in overlapping clustering.
• Set systems and dissimilarities
• Approximating dissimilarities by quasi-ultrametrics
• Hierarchical clustering schemes
• The structure and construction of taxonomic hierarchies
• Dually Chordal Graphs
• Sur la liaison et la division des points d'un ensemble fini
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item