Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149)
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 and exact algorithms for vertex multicut in interval and bounded treewidth graphs |
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
