On the Complexity of Computing the k-restricted Edge-connectivity of a Graph (Q2827813)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Computing the k-restricted Edge-connectivity of a Graph |
scientific article |
Statements
On the Complexity of Computing the k-restricted Edge-connectivity of a Graph (English)
0 references
21 October 2016
0 references
graph cut
0 references
\(k\)-restricted edge-connectivity
0 references
good edge separation
0 references
parameterized complexity
0 references
FPT-algorithm
0 references
polynomial kernel
0 references
