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

DOI10.1023/A:1008263614366MaRDI QIDQ1361082zbMATH OpenOpenAlexFDO

Authors Arun Jagota, Kenneth W. Regan

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

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

Recommendations

• scientific article; zbMATH DE number 956848
• Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem
• scientific article; zbMATH DE number 956847
• A neural algorithm for the maximum clique problem: Analysis, experiments, and circuit implementation

Cited in

(2)

• An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
• scientific article; zbMATH DE number 956848 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361082)