On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:57, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the edge-disjoint min-min problem in planar digraphs |
scientific article |
Statements
On the complexity of the edge-disjoint min-min problem in planar digraphs (English)
0 references
25 June 2012
0 references
min-min problem
0 references
planar digraph
0 references
NP-complete
0 references
disjoint path
0 references
inapproximability
0 references
