Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels (Q5363088): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2951159125 / rank | |||
Normal rank |
Revision as of 19:49, 19 March 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