An improved algorithm for hierarchical clustering using strong components

DOI10.1016/0020-0190(83)90088-1MaRDI QIDQ1838311zbMATH OpenOpenAlexFDO

Authors Robert E. Tarjan

Publication date 1983

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(83)90088-1

zbMATH Keywords

cluster analysisgraph algorithmdivide-and-conquerhierarchical decompositionstrong components

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Cites work

• Depth-First Search and Linear Graph Algorithms
• Finding Minimum Spanning Trees
• Min and max hierarchical clustering using asymmetric similarity measures
• Optimal parallel verification of minimum spanning trees in logarithmic time

Cited in

(4)

• Asymmetric aggregation operator and its application to fuzzy clustering model
• Robust Hierarchical Clustering for Directed Networks: An Axiomatic Approach
• Cluster analysis and mathematical programming
• Hierarchical clustering of asymmetric networks

This page was built for publication: An improved algorithm for hierarchical clustering using strong components

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1838311)