An exponential time parameterized algorithm for planar disjoint paths (Q5145014)
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: An exponential time parameterized algorithm for planar disjoint paths |
scientific article; zbMATH DE number 7298329
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exponential time parameterized algorithm for planar disjoint paths |
scientific article; zbMATH DE number 7298329 |
Statements
An exponential time parameterized algorithm for planar disjoint paths (English)
0 references
19 January 2021
0 references
disjoint paths
0 references
homology
0 references
network flow
0 references
parameterized complexity
0 references
planar graphs
0 references
0.9258854
0 references
0 references
0.91893345
0 references
0.9058533
0 references
0.90239036
0 references
0.9005524
0 references
0.90010446
0 references
0.8991733
0 references
