Monte Carlo Clique Search

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

The Mathematica package Combinatorica can find maximum cliques in graphs; however it is very slow because the MaximumClique function performs an exhaustive search. Randomization with a Monte Carlo method accelerates the process at the cost of losing the guarantee that the solution is optimal.

Contributed by: Michael Sollami (April 2010)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.