A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044)
From MaRDI portal
scientific article; zbMATH DE number 7032884
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths |
scientific article; zbMATH DE number 7032884 |
Statements
A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (English)
0 references
6 March 2019
0 references
approximation algorithms
0 references
interdiction problems
0 references
length-bounded cuts
0 references
NP-hardness
0 references
parameterized complexity
0 references
special graph classes
0 references
0 references
0 references
0 references
0 references
