Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disopt.2009.07.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038523985 / rank | |||
Normal rank | |||
Revision as of 23:38, 19 March 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
