A Comparison of the Stability Characteristics of Some Graph Theoretic Clustering Methods

DOI10.1109/TPAMI.1981.4767125zbMath0479.62052WikidataQ84832101 ScholiaQ84832101MaRDI QIDQ3938375

No author found.

Publication date: 1981

Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

zbMATH Keywords

connected componentsstability boundsmaximal complete subgraphsstability comparisonsstable classifications

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items (4)

Graph clustering ⋮ Clustering based on multiple paths ⋮ Clustering and community detection in directed networks: a survey ⋮ A stratificational overlapping cluster scheme

This page was built for publication: A Comparison of the Stability Characteristics of Some Graph Theoretic Clustering Methods