Performance of neural net heuristics for maximum clique on diverse highly compressible graphs
From MaRDI portal
Publication:1361082
DOI10.1023/A:1008263614366zbMath0881.90122MaRDI QIDQ1361082
Kenneth W. Regan, Arun K. Jagota
Publication date: 23 July 1997
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008263614366
approximation algorithm; undirected graph; universal distribution; largest clique; neural network algorithms; average-case performance ratio; compressible data
90C35: Programming involving graphs or networks
68T05: Learning and adaptive systems in artificial intelligence
90C27: Combinatorial optimization
Related Items