An approximation algorithm for clustering graphs with dominating diametral path (Q290198)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An approximation algorithm for clustering graphs with dominating diametral path |
scientific article; zbMATH DE number 6588283
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for clustering graphs with dominating diametral path |
scientific article; zbMATH DE number 6588283 |
Statements
An approximation algorithm for clustering graphs with dominating diametral path (English)
0 references
1 June 2016
0 references
design of algorithms
0 references
approximation algorithms
0 references
graph clustering
0 references
special graph classes
0 references
0.8264620304107666
0 references
0.7722600698471069
0 references
0.7690038681030273
0 references
0.7689641714096069
0 references
