Skip Navigation

The Computer Journal 1989 32(3):281-282; doi:10.1093/comjnl/32.3.281
© 1989 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Djokic, B.
Right arrow Articles by Stojmenovic, I.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short Note

A Fast Iterative Algorithm for Generating Set Partitions

B. Djokic1 *, M. Miyakawa2 § ++, S. Sekiguchi2 §, I. Semba3 ¶ and I. Stojmenovic4 {ddagger}

1 Department of Mathematics and Computer Science, University of Miami, P.O. Box 249085, Coral Gables, FL 33124, USA, 2 Electrotechnical Laboratory, 1-1-4 Umezono, Tsukuba 305, Japan, 3 Ibaraki University, 2-1-1 Bunkyou, Mitoshi, Ibaraki 310, Japan, 4 Department of Computer Science, University of Ottawa, 34 G. Glinksi, Ottawa, Canada K1N 6N5

An iterative algorithm for generating all partitions of the set {1,...,n} is presented. An empirical test shows that the new algorithm is faster than the previously fastest algorithm recently proposed by Er on some computers, though the former is slower than the latter on a computer where fast recursive call is provided based on an RISC architecture.

Received October 1988.

* Department of Mathematics and Computer Science, University of Miami, P.O. Box 249085, Coral Gables, FL 33124, USA.

§ Electrotechnical Laboratory, 1-1-4 Umezono Tsukuba 305, Japan.

Ibaraki University, 2-1-1 Bunkyou, Mitoshi, Ibaraki 310, Japan.

{ddagger} Department of Computer Science, University of Ottawa, 34 G. Glinksi, Ottawa, Canada K1N 6N5.

++ To whom correspondence should be addressed


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.