Computing finest mincut partitions of a graph and application to routing problems (Q2473036)
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: Computing finest mincut partitions of a graph and application to routing problems |
scientific article; zbMATH DE number 5241049
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing finest mincut partitions of a graph and application to routing problems |
scientific article; zbMATH DE number 5241049 |
Statements
Computing finest mincut partitions of a graph and application to routing problems (English)
0 references
26 February 2008
0 references
minimum cut
0 references
finest partition
0 references
clustering
0 references
cactus
0 references
routing problem
0 references
0 references
0 references
0.8269675970077515
0 references
0.7673208713531494
0 references
0.7592476606369019
0 references
