Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q630187 |
||
| Property / author | |||
| Property / author: Lin-Qing Tang / rank | |||
Revision as of 03:20, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem |
scientific article |
Statements
Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (English)
0 references
28 February 2018
0 references
label cut
0 references
minimum cut
0 references
shortest path
0 references
approximation algorithms
0 references
