On the complexity of the planar directed edge-disjoint paths problem (Q2583126)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2246752
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the planar directed edge-disjoint paths problem |
scientific article; zbMATH DE number 2246752 |
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
0.9320312142372132
0 references
0.9319130182266236
0 references
0.9257823824882508
0 references
0.8635263442993164
0 references
0.8630003929138184
0 references
