Complexity and approximability of the \(k\)-way vertex cut (Q4639693)
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 approximability of the k-way vertex cut |
scientific article; zbMATH DE number 6867786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and approximability of the \(k\)-way vertex cut |
scientific article; zbMATH DE number 6867786 |
Statements
Complexity and approximability of the <i>k</i>‐way vertex cut (English)
0 references
11 May 2018
0 references
planar graph
0 references
separator
0 references
connectivity
0 references
computational complexity
0 references
approximation scheme
0 references
0.829024076461792
0 references
0.8240680694580078
0 references
0.8176848888397217
0 references
0.8157588839530945
0 references
0.8107559680938721
0 references
