Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061)
From MaRDI portal
(Redirected from Item:Q5741783)
 | 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: Known Algorithms for Edge Clique Cover are Probably Optimal |
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
0.99999976
0 references
0.9001435
0 references
0.8869075
0 references
0.88564676
0 references
0.8847563
0 references
0.88231796
0 references
0.88047457
0 references
0.87957036
0 references
