Combinatorial Gray Code-Reference-Cited by-同舟云学术

Combinatorial Gray Code

Published:2016 Issue: Volume: Page:342-347
ISSN:
Container-title:Encyclopedia of Algorithms
language:
Short-container-title:

Author:

Ruskey Frank

Publisher

Springer New York

Link

http://link.springer.com/content/pdf/10.1007/978-1-4939-2864-4_732

Reference16 articles.

1. Eades P, McKay B (1984) An algorithm for generating subsets of fixed size with a strong minimal change property. Inf Process Lett 19:131–133

2. Ehrlich G (1973) Loopless algorithms for generating permutations, combinations, and other combinatorial configurations. J ACM 20:500–513

3. Johnson S (1963) Generation of permutations by adjacent transposition. Math Comput 17:282–285

4. Joichi JT, White DE, Williamson SG (1980) Combinatorial Gray codes. SIAM J Comput 9(1):130–141

5. Knuth DE (2011) The art of computer programming. Combinatorial algorithms, vol 4A, Part 1. Addison-Wesley, Upper Saddle River, xvi+883pp. ISBN 0-201-03804-8

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Traversing Combinatorial 0/1-Polytopes via Optimization;SIAM Journal on Computing;2024-09-09

2. Traversing combinatorial 0/1-polytopes via optimization;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Combinatorial Generation via Permutation Languages. V. Acyclic Orientations;SIAM Journal on Discrete Mathematics;2023-07-14

4. Star transposition Gray codes for multiset permutations;Journal of Graph Theory;2023-01-10

5. Combinatorial Generation via Permutation Languages. III. Rectangulations;Discrete & Computational Geometry;2022-11-04