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

DOI10.1023/A:1008263614366zbMATH Open0881.90122OpenAlexW1519132963MaRDI QIDQ1361082FDOQ1361082

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

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

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)

Cited In (2)

• An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
• Title not available (Why is that?)

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)