Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061): Difference between revisions
From MaRDI portal
Latest revision as of 09:12, 11 July 2024
scientific article; zbMATH DE number 7055310
- Known algorithms for E<scp>dge</scp> C<scp>lique</scp> C<scp>over</scp> are probably optimal
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Known Algorithms for Edge Clique Cover are Probably Optimal |
scientific article; zbMATH DE number 7055310 |
|
Statements
Known Algorithms for Edge Clique Cover are Probably Optimal (English)
0 references
Known algorithms for E<scp>dge</scp> C<scp>lique</scp> C<scp>over</scp> are probably optimal (English)
0 references
20 January 2016
0 references
15 May 2019
0 references
edge clique cover
0 references
exponential time hypothesis
0 references
parameterized complexity
0 references
kernelization
0 references
0 references
