An approximation algorithm for a semi-supervised graph clustering problem (Q4965096)
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 7315668
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for a semi-supervised graph clustering problem |
scientific article; zbMATH DE number 7315668 |
Statements
An Approximation Algorithm for a Semi-supervised Graph Clustering Problem (English)
0 references
25 February 2021
0 references
graph clustering
0 references
approximation algorithm
0 references
performance guarantee
0 references
0.9161143898963928
0 references
0.8701093196868896
0 references
0.8088504076004028
0 references
0.7825881242752075
0 references
0.774988055229187
0 references
