On the complexity of the planar directed edge-disjoint paths problem (Q2583126): 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.1007/s10107-005-0653-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2055564944 / rank | |||
Normal rank | |||
Revision as of 01:03, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the planar directed edge-disjoint paths problem |
scientific article |
Statements
On the complexity of the planar directed edge-disjoint paths problem (English)
0 references
13 January 2006
0 references
Planar graphs
0 references
Integral two-commodity-flows
0 references
NP-completeness
0 references
