A Simple Algorithm for the Planar Multiway Cut Problem (Q2731602): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jagm.2000.1148 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2084806590 / rank | |||
Normal rank | |||
Latest revision as of 02:17, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Simple Algorithm for the Planar Multiway Cut Problem |
scientific article |
Statements
A Simple Algorithm for the Planar Multiway Cut Problem (English)
0 references
12 December 2001
0 references
min-cut problem
0 references
\(k\)-way cut
0 references
