Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels (Q5363088): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:27, 9 February 2024
scientific article; zbMATH DE number 6786403
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels |
scientific article; zbMATH DE number 6786403 |
Statements
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels (English)
0 references
5 October 2017
0 references
