Performance of neural net heuristics for maximum clique on diverse highly compressible graphs (Q1361082): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
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
    0 references
    0 references
    23 July 1997
    0 references
    0 references
    0 references
    0 references
    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 references