On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855): 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.1016/j.tcs.2011.12.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2049003114 / rank | |||
Normal rank | |||
Revision as of 01:31, 20 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
