Length 3 edge-disjoint paths is NP-hard (Q445249)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Length 3 edge-disjoint paths is NP-hard |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Length 3 edge-disjoint paths is NP-hard |
scientific article |
Statements
Length 3 edge-disjoint paths is NP-hard (English)
0 references
24 August 2012
0 references
Edge-disjoint paths
0 references
NP-hardness
0 references
NP-completeness
0 references
network flow
0 references
directed graph
0 references
oriented graph
0 references
degree sequence
0 references
0.8745709
0 references
0.84636545
0 references
0.84080064
0 references
0.8404474
0 references
0.8375568
0 references
0.8373768
0 references
0.83602273
0 references
0.83602273
0 references
