On the complexity of fixed parameter clique and dominating set (Q703534)
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: On the complexity of fixed parameter clique and dominating set |
scientific article; zbMATH DE number 2126106
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of fixed parameter clique and dominating set |
scientific article; zbMATH DE number 2126106 |
Statements
On the complexity of fixed parameter clique and dominating set (English)
0 references
11 January 2005
0 references
Parameterized algorithms
0 references
Clique
0 references
Dominating set
0 references
Diamonds detection
0 references
0.92983085
0 references
0.92983085
0 references
0.9089426
0 references
0.9072423
0 references
0 references
0.9054419
0 references
0.9000578
0 references
0.8979829
0 references
