General vertex disjoint paths in series-parallel graphs (Q1208474): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:32, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | General vertex disjoint paths in series-parallel graphs |
scientific article |
Statements
General vertex disjoint paths in series-parallel graphs (English)
0 references
16 May 1993
0 references
The vertex disjoint path problem is NP-complete even for planar graphs. Robertson and Seymour proved that this problem becomes polynomial when the number of paths is a fixed integer. A linear time algorithm for solving the decision version of the general problem when the input graph is a series-parallel graph is presented.
0 references
vertex disjoint path problem
0 references
NP-complete
0 references
planar graphs
0 references
linear time algorithm
0 references
series-parallel graph
0 references
