Validity of clusters formed by graph-theoretic cluster methods
From MaRDI portal
Publication:1251676
Cites work
- k-Components, Clusters and Slicings in Graphs
- A model for taxonomy. II
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- scientific article; zbMATH DE number 3504320 (Why is no real title available?)
- scientific article; zbMATH DE number 3448387 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3351630 (Why is no real title available?)
- Network Flow and Testing Graph Connectivity
- On cliques in graphs
- On the theory and construction of k-clusters
- Some applications of graph theory to clustering
- Sur la liaison et la division des points d'un ensemble fini
- The Construction of Hierarchic and Non-Hierarchic Classifications
- THE MAXIMUM CONNECTIVITY OF A GRAPH
Cited in
(5)
This page was built for publication: Validity of clusters formed by graph-theoretic cluster methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1251676)