%0 Journal Article
%T Parallelizing a new algorithm for the set partition problem
%A Hoang Chi Thanh
%J Annales UMCS, Informatica
%@ 2083-3628
%D 2010
%I 
%R 10.2478/v10065-010-0049-1
%X In this paper we propose a new approach to organizing parallel computing to find a sequence of all solutions to a problem. We split the sequence into subsequences and then execute concurrently the processes to find these subsequences. We propose a new simple algorithm for the set partition problem and apply the above technique for this algorithm.
%U http://versita.metapress.com/content/p65m249130376868/?p=2e08f05c51da4b03a42ad0ac0d9c80d5&pi=2