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 the normal view instead:
scientific article; zbMATH DE number 7960715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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.789644718170166
0 references
0.781158983707428
0 references
0.7565246224403381
0 references
0.7529518604278564
0 references
0.7451682090759277
0 references
