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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2010.01.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093083747 / rank | |||
Normal rank | |||
Revision as of 21:38, 19 March 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
