Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Cornen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2001)
Lipski, W.: Kombinatoryka dla programistów. WNT, Warszawa (1982)
Rajasekaran, S., Lee, I.: Parallel algorithms for relational coarsest partition problems. IEEE Trans. Parallel Distributed Systems 9(7), 687–699 (1998)
Thanh, H.C.: Combinatorics. VNUH Press (1999) (in Vietnamese)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Thanh, H.C., Thanh, N.Q. (2011). An Efficient Parallel Algorithm for the Set Partition Problem. In: Nguyen, N.T., Trawiński, B., Jung, J.J. (eds) New Challenges for Intelligent Information and Database Systems. Studies in Computational Intelligence, vol 351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19953-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-19953-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19952-3
Online ISBN: 978-3-642-19953-0
eBook Packages: EngineeringEngineering (R0)