Finding <i>k</i> Disjoint Paths in a Directed Planar Graph (Q4305357)
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: Finding k Disjoint Paths in a Directed Planar Graph |
scientific article; zbMATH DE number 638382
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding <i>k</i> Disjoint Paths in a Directed Planar Graph |
scientific article; zbMATH DE number 638382 |
Statements
Finding <i>k</i> Disjoint Paths in a Directed Planar Graph (English)
0 references
9 April 1995
0 references
free group
0 references
homology
0 references
path problem
0 references
directed graphs
0 references
polynomially solvable
0 references
planar directed graphs
0 references
cohomology
0 references
0.84354085
0 references
0.8354162
0 references
0.81432235
0 references
0.81394744
0 references
0.81261134
0 references
0.8118851
0 references
0.8084165
0 references
