Parameterized complexity of finding connected induced subgraphs (Q897959)
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: Parameterized complexity of finding connected induced subgraphs |
scientific article; zbMATH DE number 6517487
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of finding connected induced subgraphs |
scientific article; zbMATH DE number 6517487 |
Statements
Parameterized complexity of finding connected induced subgraphs (English)
0 references
8 December 2015
0 references
parameterized complexity
0 references
hereditary properties
0 references
connected induced subgraphs
0 references
0.98478854
0 references
0.9576189
0 references
0.9510666
0 references
0.9410347
0 references
0.9410347
0 references
0.9364743
0 references
0.9364743
0 references
0.91394186
0 references
0.91053146
0 references
