On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:42, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the multicut problem in bounded tree-width graphs and digraphs |
scientific article |
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
