Known algorithms for edge clique cover are probably optimal (Q6829367)
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 6533447
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Known algorithms for edge clique cover are probably optimal |
scientific article; zbMATH DE number 6533447 |
Statements
Known algorithms for edge clique cover are probably optimal (English)
0 references
20 January 2016
0 references
edge clique cover
0 references
exponential time hypothesis
0 references
parameterized complexity
0 references
kernelization
0 references
