An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7194008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient local search algorithm for solving maximum edge weight clique problem in large graphs |
scientific article; zbMATH DE number 7194008 |
Statements
An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (English)
0 references
27 April 2020
0 references
graph reduction
0 references
maximum edge weight clique problem
0 references
stochastic local search
0 references
0 references
0 references
0 references
0 references
0.8357911705970764
0 references
0.81125408411026
0 references
0.8070855140686035
0 references
0.8036841154098511
0 references
0.7960045337677002
0 references
