Performance of neural net heuristics for maximum clique on diverse highly compressible graphs (Q1361082): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1008263614366 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1519132963 / rank | |||
Normal rank | |||
Latest revision as of 09:31, 30 July 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
