On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:15, 5 March 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
