Detecting and counting small patterns in planar graphs in subexponential parameterized time (Q5145013)
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: Detecting and counting small patterns in planar graphs in subexponential parameterized time |
scientific article; zbMATH DE number 7298328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting and counting small patterns in planar graphs in subexponential parameterized time |
scientific article; zbMATH DE number 7298328 |
Statements
Detecting and counting small patterns in planar graphs in subexponential parameterized time (English)
0 references
19 January 2021
0 references
parameterized complexity
0 references
subgraph isomorphism
0 references
0.8244842886924744
0 references
0.8056097030639648
0 references
0.8006137609481812
0 references
0.7959189414978027
0 references
0.7954282760620117
0 references
