Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134): 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.1007/s00453-016-0265-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2566743541 / rank | |||
Normal rank | |||
Revision as of 01:14, 20 March 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
