Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586)
From MaRDI portal
scientific article; zbMATH DE number 7672198
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
