Combinatorial Generation
Combinatorial generation is to generate combinatorial objects systematically one by one with a minimum amount of effort. Combinatorial objects such as permutations are as old as human history. In ancient times, diplomats were worrying about how to sit dignitaries around the dinner table in a different way each time. The following is a systematic way to generate well formed parenthesis strings by swapping a pair of parenthesis each time. |
|
- An O(1) Time Algorithm for generating Multi-set Permutations, ISAAC '99.
- O(1) Time Algorithms for Combinatorial Generation by Tree Traversal, Computer Journal, vol. 42, no. 5, pp.400-408, 1999.