A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045)
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 maximum edge-weight clique extraction algorithm based on branch-and-bound |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A maximum edge-weight clique extraction algorithm based on branch-and-bound |
scientific article |
Statements
A maximum edge-weight clique extraction algorithm based on branch-and-bound (English)
0 references
30 July 2020
0 references
maximum edge-weight clique
0 references
exact algorithm
0 references
branch-and-bound
0 references
upper bound calculation
0 references
NP-hard
0 references
0 references
0 references
0 references
0 references
0.886727511882782
0 references
0.8700090646743774
0 references
0.8506640791893005
0 references
0.8470131754875183
0 references
0.8458961248397827
0 references
