Clustering as a dual problem to colouring (Q2140780)
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 7530569
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clustering as a dual problem to colouring |
scientific article; zbMATH DE number 7530569 |
Statements
Clustering as a dual problem to colouring (English)
0 references
23 May 2022
0 references
graph algorithm
0 references
community detection
0 references
Petford-Welsh algorithm
0 references
simulated annealing
0 references
complex networks
0 references
0.9102776
0 references
0 references
0.9040507
0 references
0.8825224
0 references
0 references
0.87878066
0 references
0.8739664
0 references
0.87029153
0 references
