Performance of neural net heuristics for maximum clique on diverse highly compressible graphs (Q1361082)
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: Performance of neural net heuristics for maximum clique on diverse highly compressible graphs |
scientific article; zbMATH DE number 1038458
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Performance of neural net heuristics for maximum clique on diverse highly compressible graphs |
scientific article; zbMATH DE number 1038458 |
Statements
Performance of neural net heuristics for maximum clique on diverse highly compressible graphs (English)
0 references
23 July 1997
0 references
universal distribution
0 references
compressible data
0 references
largest clique
0 references
undirected graph
0 references
average-case performance ratio
0 references
approximation algorithm
0 references
neural network algorithms
0 references
0.7910702228546143
0 references
