Parameterized algorithm for the disjoint path problem on planar graphs: exponential in \(k^2\) and linear in \(n\) (Q6538679)
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: Parameterized algorithm for the disjoint path problem on planar graphs: exponential in \(k^2\) and linear in \(n\) |
scientific article; zbMATH DE number 7848104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized algorithm for the disjoint path problem on planar graphs: exponential in \(k^2\) and linear in \(n\) |
scientific article; zbMATH DE number 7848104 |
Statements
Parameterized algorithm for the disjoint path problem on planar graphs: exponential in \(k^2\) and linear in \(n\) (English)
0 references
14 May 2024
0 references
