On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1502.07659 / rank | |||
Normal rank | |||
Revision as of 14:44, 18 April 2024
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
9 January 2017
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
