On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C60 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6094038 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
treewidth | |||
| Property / zbMATH Keywords: treewidth / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
digraph decompositions | |||
| Property / zbMATH Keywords: digraph decompositions / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
parameterized complexity | |||
| Property / zbMATH Keywords: parameterized complexity / rank | |||
Normal rank | |||
Revision as of 11:47, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the algorithmic effectiveness of digraph decompositions and complexity measures |
scientific article |
Statements
On the algorithmic effectiveness of digraph decompositions and complexity measures (English)
0 references
16 October 2012
0 references
treewidth
0 references
digraph decompositions
0 references
parameterized complexity
0 references
