An Efficient Algorithm for Generating all Partitions of the Set{1, 2, ..., n}
スポンサーリンク
概要
- 論文の詳細を見る
We consider the problem of generating all partitions of the set{1, 2, ..., n}. An efficient algorithm based on backtrack technique is presented. The average running time per partition is proved to be bounded by a constant. Experiments showed that our algorithm is faster than other algorithms so far proposed.
- 一般社団法人情報処理学会の論文
- 1984-03-31
著者
関連論文
- Immunohistochemical Analysis of Cell Proliferation and Suppression of Ameloblastoma with Special Reference to Plexiform and Follicular Ameloblastoma
- Genetic Controls of Susceptibility and Resistance to 4-Nitroquinoline 1-Oxide-induced Tongue Carcinomas in Rats
- Specificities of the Early Body Formation in the Lancelet Embryo
- Expressions of junB and c-fos are enhanced in 4-nitroquinoline 1-oxide-induced rat tongue cancers
- Generation of Permutations by Using an Input Restricted-deque or an Output Restricted-deque
- Generation of Stack Sequences in Lexicographical Order
- 10. BMP4 induce ectopic cartilage formation in the mouse embryonal mandibular process : BMP4 mediates Msx2 and Sox9 expression during chondrogenesis.
- Generation of Permutations by Using a Stack or a Queue
- An Efficient Algorithm for Generating all Partitions of the Set{1, 2, ..., n}
- A Note on Enumerating Combinations in Lexicographical Order
- Systematic Method for Determining the Number of Multiplications Required to Compute x^m, Where m is a Positive Integer
- On Generating and Counting All the Longest Increasing Subsequences
- An O(1) Time Algorithm for Generating Fibonacci Strings(Special Issue on Selected Papers from LA Symposium)
- Generation of Binary Trees from Stack Permutations