Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 08:13, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs |
scientific article |
Statements
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (English)
0 references
23 November 2007
0 references
NP-completeness
0 references
parameterized complexity
0 references
