Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools

We construct parallel algorithms with implementations to solve the clique problem in practice and research their computing time compared with sequential algorithms. The parallel algorithms are implemented in Java using threads. Best efficiency is achieved by solving the problem of task scheduling by using task pools.

• Type: Conference
• Year: 2005
• Where: IPPS
• Authors: Holger Blaar, Thomas Lange, Renate Winter, Marcel Karnstedt
• Keywords: Clique Problem, Distributed And Parallel Computing, IPPS 2005, Parallel Algorithms, Sequential Algorithms