Complexity and performance of a graph theory algorithm for cluster analysis† (Q3962478)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and performance of a graph theory algorithm for cluster analysis† |
scientific article |
Statements
Complexity and performance of a graph theory algorithm for cluster analysis† (English)
0 references
1983
0 references
algorithm for generating maximal minimally strongly connected subgraphs or cliques in undirected graphs
0 references
implementation of the subgraph generation algorithm
0 references
