A Survey of Combinatorial Gray Codes
SIAM Review
Generation of Rosary permutations expressed in Hamiltonian circuits
Communications of the ACM
An algorithm for generating permutations
Communications of the ACM
Communications of the ACM
Combinatorial Algorithms: For Computers and Hard Calculators
Combinatorial Algorithms: For Computers and Hard Calculators
The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions
The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions
A loopless Gray code for rooted trees
ACM Transactions on Algorithms (TALG)
Generating combinations by prefix shifts
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Symmetry Compression Method for Discovering Network Motifs
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
Combinatorial algorithms that list combinatorial objects in minimal change order are of fundamental interest in computer science and mathematics. In minimal change ordering, successive elements differ in some pre-specified small way. In this paper, we deal with the generation of paths in a special type of minimal change ordering, the revolving door ordering. We propose a simple algorithm to list all paths in a complete graph, Kn, with n vertices in revolving door order such that each path is generated exactly once. The algorithm is built using space and time efficient schemes that list all spanning paths and "path sets" in revolving door order. Our algorithm is optimal in the sense that it operates in constant amortized time (CAT) and uses linear space.