Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PORTA / rank | |||
Normal rank | |||
Revision as of 14:42, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating partitions of a graph into a fixed number of minimum weight cuts |
scientific article |
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
