Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth |
scientific article; zbMATH DE number 7159808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth |
scientific article; zbMATH DE number 7159808 |
Statements
Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (English)
0 references
29 January 2020
0 references
partial multicut
0 references
graphs of bounded treewidth
0 references
0 references
0 references
0.8824084401130676
0 references
0.8644472360610962
0 references
0.851364254951477
0 references
0.8305344581604004
0 references
