Minimum cost subpartitions in graphs (Q845968)
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: Minimum cost subpartitions in graphs |
scientific article; zbMATH DE number 5664783
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum cost subpartitions in graphs |
scientific article; zbMATH DE number 5664783 |
Statements
Minimum cost subpartitions in graphs (English)
0 references
29 January 2010
0 references
approximation algorithms
0 references
extreme vertex sets
0 references
clustering
0 references
cut
0 references
graph
0 references
\(k\)-way cut
0 references
partition
0 references
0 references
0.8108964562416077
0 references
0.8039208650588989
0 references
0.8037508130073547
0 references
