Computing finest mincut partitions of a graph and application to routing problems (Q2473036)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing finest mincut partitions of a graph and application to routing problems |
scientific article |
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
