Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs (Q3004683)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs |
scientific article |
Statements
Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs (English)
0 references
3 June 2011
0 references
Min-Min problem
0 references
planar digraph
0 references
NP-completeness
0 references
disjoint path
0 references
inapproximability
0 references
