A Versatile Algorithm to Generate Various Combinatorial Structures

Details A Versatile Algorithm to Generate Various Combinatorial Structures A Versatile Algorithm to Generate Various Combinatorial Structures

2010-09-21

arxiv.org/abs/1009.4214v2

Computer Science

Data Structures and Algorithms

Scientific paper

Algorithms to generate various combinatorial structures find tremendous importance in computer science. In this paper, we begin by reviewing an algorithm proposed by Rohl that generates all unique permutations of a list of elements which possibly contains repetitions, taking some or all of the elements at a time, in any imposed order. The algorithm uses an auxiliary array that maintains the number of occurrences of each unique element in the input list. We provide a proof of correctness of the algorithm. We then show how one can efficiently generate other combinatorial structures like combinations, subsets, n-Parenthesizations, derangements and integer partitions & compositions with minor changes to the same algorithm.

Affiliated with

Also associated with

No associations

Rating

A Versatile Algorithm to Generate Various Combinatorial Structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Versatile Algorithm to Generate Various Combinatorial Structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Versatile Algorithm to Generate Various Combinatorial Structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-637280