A new and improved algorithm for the 3-cut problem (Q1267194): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Polynomial Algorithm for the k-cut Problem for Fixed k / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4525700 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4739657 / rank | |||
Normal rank | |||
Latest revision as of 15:30, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new and improved algorithm for the 3-cut problem |
scientific article |
Statements
A new and improved algorithm for the 3-cut problem (English)
0 references
18 March 1999
0 references
min cut
0 references
minimum 3-cut
0 references
edge-weighted graph
0 references
