Complexity and approximability of the <i>k</i>‐way vertex cut (Q4639693): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:49, 7 February 2024
scientific article; zbMATH DE number 6867786
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and approximability of the <i>k</i>‐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
