Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501)
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: Generating partitions of a graph into a fixed number of minimum weight cuts |
scientific article; zbMATH DE number 6168916
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating partitions of a graph into a fixed number of minimum weight cuts |
scientific article; zbMATH DE number 6168916 |
Statements
Generating partitions of a graph into a fixed number of minimum weight cuts (English)
0 references
31 May 2013
0 references
mincut
0 references
graph partitioning
0 references
cactus
0 references
traveling salesman problem
0 references
0 references
0 references
0 references
