Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels

Research article (Repository of the Academy's Library (Library of the Hungarian Academy of Sciences), 2015) · cited 14× · AI/ML
Press Enter · cited answer in seconds

Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels

Summary

Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels is a scholarly article[1].

Key Facts

  • Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels's instance of is recorded as scholarly article[2].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. Retrieved May 24, 2026, from https://4ort.xyz/entity/characterizing-the-easy-to-find-subgraphs-from-the-viewpoint-of-polynomial-time-algorithms-kernels-and-turing-kernels
MLA “Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/characterizing-the-easy-to-find-subgraphs-from-the-viewpoint-of-polynomial-time-algorithms-kernels-and-turing-kernels.
BibTeX @misc{4ortxyz_characterizing-the-easy-to-find-subgraphs-from-the-viewpoint-of-polynomial-time-algorithms-kernels-and-turing-kernels_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels}}, year = {2026}, url = {https://4ort.xyz/entity/characterizing-the-easy-to-find-subgraphs-from-the-viewpoint-of-polynomial-time-algorithms-kernels-and-turing-kernels}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels — https://4ort.xyz/entity/characterizing-the-easy-to-find-subgraphs-from-the-viewpoint-of-polynomial-time-algorithms-kernels-and-turing-kernels (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/characterizing-the-easy-to-find-subgraphs-from-the-viewpoint-of-polynomial-time-algorithms-kernels-and-turing-kernels · Last refreshed: