A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number (Q1799389)
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: A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number |
scientific article; zbMATH DE number 6958406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number |
scientific article; zbMATH DE number 6958406 |
Statements
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number (English)
0 references
18 October 2018
0 references
clique partition
0 references
computational complexity
0 references
clique number
0 references
0.8213130235671997
0 references
0.7927512526512146
0 references
0.7847847938537598
0 references
