Abstract
An algorithm for finding a maximum clique in a graph is presented which uses the Comtet regularization of the Motzkin/Straus continuous problem formulation: maximize an indefinite quadratic form over the standard simplex. We shortly review some surprising connections of the problem with dynamic principles of evolutionary game theory, and give a detailed report on our numerical experiences with the method proposed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
