A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765)
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 Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs |
scientific article; zbMATH DE number 7406493
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs |
scientific article; zbMATH DE number 7406493 |
Statements
A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (English)
0 references
5 October 2021
0 references
heuristics
0 references
search
0 references
0 references
0 references
0 references
0.9472972
0 references
0.9424472
0 references
0.9370903
0 references
0.9286299
0 references
0.92791986
0 references
0 references
0.9236323
0 references
0.9203563
0 references
