Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127775238, #quickstatements; #temporary_batch_1721927112556 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127775238 / rank | |||
Normal rank | |||
Latest revision as of 18:10, 25 July 2024
scientific article; zbMATH DE number 7136425
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs |
scientific article; zbMATH DE number 7136425 |
Statements
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (English)
0 references
25 November 2019
0 references
hardness in P
0 references
clique-width
0 references
fully polynomial FPT
0 references
modular decomposition
0 references
neighbourhood diversity
0 references
primeval decomposition
0 references
split decomposition
0 references
0 references
0 references
0 references
0 references
