Critical node cut parameterized by treewidth and solution size is \(W[1]\)-hard (Q1687900)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6821987
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Critical node cut parameterized by treewidth and solution size is \(W[1]\)-hard |
scientific article; zbMATH DE number 6821987 |
Statements
Critical node cut parameterized by treewidth and solution size is \(W[1]\)-hard (English)
0 references
4 January 2018
0 references
0.8700605630874634
0 references
0.8644853234291077
0 references
0.7749797701835632
0 references
0.7618241310119629
0 references
0.7583892941474915
0 references
