Complexity and performance of a graph theory algorithm for cluster analysis† (Q3962478)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3784281
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and performance of a graph theory algorithm for cluster analysis† |
scientific article; zbMATH DE number 3784281 |
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
