Efficient coroutine generation of constrained Gray sequences
数据结构与算法
2009-09-29 v1
摘要
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.
引用
@article{arxiv.cs/0404058,
title = {Efficient coroutine generation of constrained Gray sequences},
author = {Donald E. Knuth and Frank Ruskey},
journal= {arXiv preprint arXiv:cs/0404058},
year = {2009}
}