Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph (Q1959418): Difference between revisions
From MaRDI portal
Latest revision as of 07:44, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph |
scientific article |
Statements
Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph (English)
0 references
7 October 2010
0 references
algorithms
0 references
directed acyclic graphs
0 references
dynamic programming
0 references
fully polynomial-time approximation schemes
0 references
planar graphs
0 references
pseudo-polynomial time
0 references
vertex-disjoint paths
0 references
