Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7672198
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering |
scientific article; zbMATH DE number 7672198 |
Statements
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (English)
0 references
4 April 2023
0 references
parameterized complexity
0 references
subexponential algorithms
0 references
treewidth
0 references
planar graphs
0 references
subgraph isomorphism
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8350419998168945
0 references
0.834741473197937
0 references
0.8314924836158752
0 references
0.8279283046722412
0 references
0.8220905065536499
0 references
