Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7063545
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast exact algorithms for some connectivity problems parameterized by clique-width |
scientific article; zbMATH DE number 7063545 |
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
0 references
0 references
0 references
0.91407555
0 references
0.9136431
0 references
0.9135377
0 references
0 references
0.8928261
0 references
0.8920087
0 references
0.8917432
0 references
0.8910045
0 references
0.8898358
0 references
