On the triangle clique cover and \(K_t\) clique cover problems (Q2279271)
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 triangle clique cover and K_t clique cover problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the triangle clique cover and \(K_t\) clique cover problems |
scientific article |
Statements
On the triangle clique cover and \(K_t\) clique cover problems (English)
0 references
12 December 2019
0 references
triangle clique cover
0 references
edge clique cover
0 references
Turan graph
0 references
intersection number
0 references
community detection
0 references
graph clustering
0 references
0 references
0.8928956
0 references
0.8897563
0 references
0 references
0.88666755
0 references
0.88666755
0 references
0.8789264
0 references
