A hierarchical clustering algorithm using strong components

R. Endre Tarjan

doi:10.1016/0020-0190(82)90136-3

A hierarchical clustering algorithm using strong components

Research output: Contribution to journal › Article › peer-review

Original language	English (US)
Pages (from-to)	26-29
Number of pages	4
Journal	Information Processing Letters
Volume	14
Issue number	1
DOIs	https://doi.org/10.1016/0020-0190(82)90136-3
State	Published - Mar 27 1982
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Keywords

Cluster analysis
graph algorithm
graph decomposition
strong components

Access to Document

10.1016/0020-0190(82)90136-3

Cite this

@article{3b99d356735b44b7bc873feb85e85d22,

title = "A hierarchical clustering algorithm using strong components",

keywords = "Cluster analysis, graph algorithm, graph decomposition, strong components",

author = "Tarjan, \{R. Endre\}",

year = "1982",

month = mar,

day = "27",

doi = "10.1016/0020-0190(82)90136-3",

language = "English (US)",

volume = "14",

pages = "26--29",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - A hierarchical clustering algorithm using strong components

AU - Tarjan, R. Endre

PY - 1982/3/27

Y1 - 1982/3/27

KW - Cluster analysis

KW - graph algorithm

KW - graph decomposition

KW - strong components

UR - https://www.scopus.com/pages/publications/0020100161

UR - https://www.scopus.com/inward/citedby.url?scp=0020100161&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(82)90136-3

DO - 10.1016/0020-0190(82)90136-3

M3 - Article

AN - SCOPUS:0020100161

SN - 0020-0190

VL - 14

SP - 26

EP - 29

JO - Information Processing Letters

JF - Information Processing Letters

IS - 1

ER -

A hierarchical clustering algorithm using strong components

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this