An improved algorithm for hierarchical clustering using strong components

DOI10.1016/0020-0190(83)90088-1zbMath0509.68059OpenAlexW2086028466MaRDI QIDQ1838311

Robert Endre 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

graph algorithmcluster analysisdivide-and-conquerhierarchical decompositionstrong components

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

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