Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2007.02.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2153724959 / rank | |||
Normal rank | |||
Revision as of 23:33, 19 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
