Performance of neural net heuristics for maximum clique on diverse highly compressible graphs (Q1361082): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:53, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Performance of neural net heuristics for maximum clique on diverse highly compressible graphs |
scientific article |
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
