On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:38, 7 February 2024
scientific article; zbMATH DE number 6864492
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Algorithms Employing Treewidth for $L$-bounded Cut Problems |
scientific article; zbMATH DE number 6864492 |
Statements
On Algorithms Employing Treewidth for $L$-bounded Cut Problems (English)
0 references
25 April 2018
0 references
approximation algorithm
0 references
