Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149): Difference between revisions
From MaRDI portal
Latest revision as of 12:26, 27 June 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
0 references