The label cut problem with respect to path length and label frequency (Q313969)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6626486
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The label cut problem with respect to path length and label frequency |
scientific article; zbMATH DE number 6626486 |
Statements
The label cut problem with respect to path length and label frequency (English)
0 references
12 September 2016
0 references
label \(s\)-\(t\) cut
0 references
global label cut
0 references
parameterized algorithm
0 references
approximation algorithm
0 references
computational complexity
0 references
0.9140264391899108
0 references
0.8560349345207214
0 references
0.8527458310127258
0 references
0.8409842848777771
0 references
0.8249917030334473
0 references
