Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.)
Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.)
On rotations and the generation of binary trees
Journal of Algorithms
Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
The Art of Computer Programming: Combinatorial Algorithms, Part 1
The Art of Computer Programming: Combinatorial Algorithms, Part 1
Hamilton cycles in restricted rotator graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
| Hi-index | 0.00 |
We reinterpret classic Gray codes for binary strings, permutations, combinations, binary trees, and set partitions using a simple greedy algorithm. The algorithm begins with an initial object and an ordered list of operations, and then repeatedly creates a new object by applying the first possible operation to the most recently created object.