Clustering on \(k\)-edge-colored graphs (Q335326)
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: Clustering on k-edge-colored graphs |
scientific article; zbMATH DE number 6646857
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clustering on \(k\)-edge-colored graphs |
scientific article; zbMATH DE number 6646857 |
Statements
Clustering on \(k\)-edge-colored graphs (English)
0 references
2 November 2016
0 references
clustering
0 references
approximation algorithms
0 references
coloring
0 references
0 references
0.94560045
0 references
0.9144178
0 references
0.90897787
0 references
0 references
0.90677917
0 references
0.9040507
0 references
0.9002856
0 references
0 references
