Coverability and sub-exponential parameterized algorithms in planar graphs (Q4972036)
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: Coverability and sub-exponential parameterized algorithms in planar graphs |
scientific article; zbMATH DE number 7135331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coverability and sub-exponential parameterized algorithms in planar graphs |
scientific article; zbMATH DE number 7135331 |
Statements
22 November 2019
0 references
parameterized algorithms
0 references
branchwidth
0 references
planar graphs
0 references
coverable problems
0 references
radial domination
0 references
scattered set
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8491611480712891
0 references
0.8279283046722412
0 references
0.8218628764152527
0 references
0.8214685320854187
0 references
