Performance of neural net heuristics for maximum clique on diverse highly compressible graphs

DOI10.1023/A:1008263614366zbMath0881.90122OpenAlexW1519132963MaRDI 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

zbMATH Keywords

approximation algorithmundirected graphuniversal distributionlargest cliqueneural network algorithmsaverage-case performance ratiocompressible data

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Related Items (1)

An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network

This page was built for publication: Performance of neural net heuristics for maximum clique on diverse highly compressible graphs