Tight algorithms for connectivity problems parameterized by clique-width (Q6657014)
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: Tight algorithms for connectivity problems parameterized by clique-width |
scientific article; zbMATH DE number 7961904
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight algorithms for connectivity problems parameterized by clique-width |
scientific article; zbMATH DE number 7961904 |
Statements
Tight algorithms for connectivity problems parameterized by clique-width (English)
0 references
6 January 2025
0 references
parameterized complexity
0 references
connectivity
0 references
clique-width
0 references
cut\&count
0 references
lower bound
0 references
