The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246)
From MaRDI portal
scientific article; zbMATH DE number 1699135
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The edge-disjoint paths problem is NP-complete for series-parallel graphs |
scientific article; zbMATH DE number 1699135 |
Statements
The edge-disjoint paths problem is NP-complete for series-parallel graphs (English)
0 references
22 April 2002
0 references
series-parallel graphs
0 references
subgraph isomorphism problem
0 references
