The complexity of finding two disjoint paths with min-max objective function (Q584275): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(90)90024-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2019637647 / rank | |||
Normal rank | |||
Latest revision as of 09:23, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of finding two disjoint paths with min-max objective function |
scientific article |
Statements
The complexity of finding two disjoint paths with min-max objective function (English)
0 references
1990
0 references
The paper considers the problem of finding two disjoint paths from a given node s to another node t in a network such that the length of the longer path is minimized. The paths may be vertex-disjoint or arc- disjoint and the network may be directed or undirected. It is shown that all four versions as well as some related problems are strongly NP- complete. The paper also gives a pseudo-polynomial-time algorithm for the acyclic directed case.
0 references
paths
0 references
vertex-disjoint
0 references
arc-disjoint
0 references
NP-complete
0 references
