Sciweavers

Share
IPPS
2005
IEEE

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

9 years 4 months ago
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.
Holger Blaar, Thomas Lange, Renate Winter, Marcel
Added 25 Jun 2010
Updated 25 Jun 2010
Type Conference
Year 2005
Where IPPS
Authors Holger Blaar, Thomas Lange, Renate Winter, Marcel Karnstedt
Comments (0)
books