Parameterized complexity of critical node cuts (Q5363787)
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 6784982
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of critical node cuts |
scientific article; zbMATH DE number 6784982 |
Statements
29 September 2017
0 references
graph-cut problem
0 references
NP-hard problem
0 references
treewidth
0 references
Parameterized Complexity of Critical Node Cuts (English)
0 references
0.9978727698326112
0 references
0.8644853234291077
0 references
0.8010180592536926
0 references
0.7795922160148621
0 references
