Coroutine-based combinatorial generation
The two well-known approaches to designing combinatorial generation algorithms are the recursive approach and the iterative approach. In this thesis a third design approach using coroutines, introduced by Knuth and Ruskey, is explored further. An introduction to coroutines and their implementation i...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | English en |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/5879 |