On the Complexity of Computing the k-restricted Edge-connectivity of a Graph (Q2827813): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-662-53174-7_16 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2964059668 / rank | |||
Normal rank | |||
Revision as of 20:18, 19 March 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
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
