An improved algorithm for hierarchical clustering using strong components (Q1838311): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(83)90088-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086028466 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding Minimum Spanning Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Min and max hierarchical clustering using asymmetric similarity measures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal parallel verification of minimum spanning trees in logarithmic time / rank | |||
Normal rank | |||
Latest revision as of 17:37, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved algorithm for hierarchical clustering using strong components |
scientific article |
Statements
An improved algorithm for hierarchical clustering using strong components (English)
0 references
1983
0 references
cluster analysis
0 references
divide-and-conquer
0 references
graph algorithm
0 references
hierarchical decomposition
0 references
strong components
0 references
