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)
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: 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; zbMATH DE number 5796725
| 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; zbMATH DE number 5796725 |
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
