Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes (Q6655669)
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: Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes |
scientific article; zbMATH DE number 7960715
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes |
scientific article; zbMATH DE number 7960715 |
Statements
Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes (English)
0 references
27 December 2024
0 references
fixed-parameter tractability
0 references
important separators
0 references
secluded subgraphs
0 references
0 references
0 references
0 references
0 references
