An Efficient Parallel Algorithm for the Set Partition Problem

  • Hoang Chi Thanh
  • Nguyen Quang Thanh
Part of the Studies in Computational Intelligence book series (SCI, volume 351)


In this paper we propose a new approach in organizing a parallel computing to find the sequence of all solutions to a problem. We split the sequence of desirable solutions into subsequences and then execute concurrently processes to find these subsequences. We propose a new simple algorithm for the set partition problem and apply the above technique to this problem.


algorithm complexity parallel computing set partition 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cameron, K., Eschen, E.M., Hoang, C.T., Sritharan, R.: The list partition problem for graphs. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, pp. 391–399 (2004)Google Scholar
  2. 2.
    Cornen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2001)Google Scholar
  3. 3.
    Lipski, W.: Kombinatoryka dla programistów. WNT, Warszawa (1982)Google Scholar
  4. 4.
    Rajasekaran, S., Lee, I.: Parallel algorithms for relational coarsest partition problems. IEEE Trans. Parallel Distributed Systems 9(7), 687–699 (1998)CrossRefGoogle Scholar
  5. 5.
    Thanh, H.C.: Combinatorics. VNUH Press (1999) (in Vietnamese)Google Scholar
  6. 6.
    Thanh, H.C.: Transforming Sequential Processes of a Net System into Concurrent Ones. International Journal of Knowledge-based and Intelligent Engineering Systems 11(6), 391–397 (2007)Google Scholar
  7. 7.
    Thanh, H.C.: Bounded sequence problem and some its applications. In: Proceedings of Japan-Vietnam Workshop on Software Engineering, Hanoi 2010, pp. 74–83 (2010)Google Scholar
  8. 8.
    Thanh, H.C., Thanh, N.Q.: A Parallel Dimensionality Reduction for Time-Series Data and Some Its Applications. International Journal of Intelligent Information and Database Systems, InderScience 5(1), 39–48 (2011)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Hoang Chi Thanh
    • 1
  • Nguyen Quang Thanh
    • 2
  1. 1.Department of InformaticsHanoi University of Science, VNUHThanh XuanVietnam
  2. 2.Da Nang Department of Information and CommunicationDa NangVietnam

Personalised recommendations