1996 | ReviewPaper | Chapter
Parallelizable evolutionary dynamics principles for solving the maximum clique problem
Authors : Marcello Pelillo, Immanuel M. Bomze
Published in: Parallel Problem Solving from Nature — PPSN IV
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
An algorithm for approximately solving the maximum clique is presented which uses relaxation labeling neural network techniques, focusing on the continuous problem formulation: maximize a quadratic form over the standard simplex. We employ somewhat surprising connections of the latter problem with dynamic principles of evolutionary game theory, and give a detailed report on our numerical experiences with the method proposed.