On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.7155/jgaa.00462 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.7155/JGAA.00462 / rank | |||
Normal rank | |||
Latest revision as of 14:56, 30 December 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
0 references
0 references
0 references
0 references
0 references
