On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745)
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: On the complexity of the multicut problem in bounded tree-width graphs and digraphs |
scientific article; zbMATH DE number 5324161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the multicut problem in bounded tree-width graphs and digraphs |
scientific article; zbMATH DE number 5324161 |
Statements
On the complexity of the multicut problem in bounded tree-width graphs and digraphs (English)
0 references
10 September 2008
0 references
multicuts
0 references
NP-hardness
0 references
APX-hardness
0 references
bounded tree-width
0 references
0 references
0 references
0 references
0.9460981
0 references
0.9431664
0 references
0.93415064
0 references
0.9277553
0 references
0.92221594
0 references
