Efficient coroutine generation of constrained Gray sequences

Details Efficient coroutine generation of constrained Gray sequences Efficient coroutine generation of constrained Gray sequences

2004-04-30

arxiv.org/abs/cs/0404058v1

Lecture Notes in Computer Science 2635 (2004), 183--204

Computer Science

Data Structures and Algorithms

Scientific paper

We study an interesting family of cooperating coroutines, which is able to generate all patterns of bits that satisfy certain fairly general ordering constraints, changing only one bit at a time. (More precisely, the directed graph of constraints is required to be cycle-free when it is regarded as an undirected graph.) If the coroutines are implemented carefully, they yield an algorithm that needs only a bounded amount of computation per bit change, thereby solving an open problem in the field of combinatorial pattern generation.

Affiliated with

Also associated with

No associations

Rating

Efficient coroutine generation of constrained Gray sequences 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 Efficient coroutine generation of constrained Gray sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient coroutine generation of constrained Gray sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-286809