General vertex disjoint paths in series-parallel graphs (Q1208474)
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: General vertex disjoint paths in series-parallel graphs |
scientific article; zbMATH DE number 166470
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | General vertex disjoint paths in series-parallel graphs |
scientific article; zbMATH DE number 166470 |
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
0 references
0.8469145894050598
0 references
0.8441612720489502
0 references
0.8398053050041199
0 references
