We discuss a parallel programming method for solving the maximum clique problem. We use the partitioned shared memory programming language, Unified Parallel , for the parallel implementation. The problem of load balancing is discussed and the steal stack is used to solve this problem. Implementation details are provided.
