Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:56, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast exact algorithms for some connectivity problems parameterized by clique-width |
scientific article |
Statements
Fast exact algorithms for some connectivity problems parameterized by clique-width (English)
0 references
6 June 2019
0 references
connected \(\sigma, \rho\)-domination
0 references
