On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666)
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 6672923
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of computing the \(k\)-restricted edge-connectivity of a graph |
scientific article; zbMATH DE number 6672923 |
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
0 references
0.992120623588562
0 references
0.7975977659225464
0 references
0.7948615550994873
0 references
0.7925955057144165
0 references
0.788917064666748
0 references
