A pivoting-based heuristic for the maximum clique problem. (Q2768058)
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 1698950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A pivoting-based heuristic for the maximum clique problem. |
scientific article; zbMATH DE number 1698950 |
Statements
2001
0 references
linear complementarity problem
0 references
Lemke's algorithm
0 references
A pivoting-based heuristic for the maximum clique problem. (English)
0 references
0.8588600754737854
0 references
0.852268397808075
0 references
0.8247905969619751
0 references
0.8210169672966003
0 references
