Approximate algorithms for graph clustering problem (Q5151277)
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 7311669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate algorithms for graph clustering problem |
scientific article; zbMATH DE number 7311669 |
Statements
APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM (English)
0 references
17 February 2021
0 references
graph clustering
0 references
approximation algorithm
0 references
performance guarantee
0 references
0 references
0.8050592541694641
0 references
0.7947843074798584
0 references
0.7545279264450073
0 references
0.7382729649543762
0 references
