Some Hamilton Paths and a Minimal Change Algorithm-Reference-Cited by-同舟云学术

Some Hamilton Paths and a Minimal Change Algorithm

Published:1984-01 Issue:1 Volume:31 Page:19-29
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Eades Peter¹,Hickey Michael¹,Read Ronald C.²

Affiliation:

1. Department of Computer Science, University of Queensland, St. Lucia, Queensland, Australia 4067

2. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference6 articles.

1. Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

2. codes in graphs of subsets;HJ J. T.;Discrete Math.,1980

3. Three new combination algorithms with the minimal change property

4. NIJENHUIS A. ANO WILF H. S. Combmatortal Algorahms 2rid ed. Academic Press New York 1978. NIJENHUIS A. ANO WILF H. S. Combmatortal Algorahms 2rid ed. Academic Press New York 1978.

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

1. Area-Efficient LFSR-Based Stochastic Number Generators With Minimum Correlation;IEEE Design & Test;2024-02

2. On Duplication-Free Codes for Disjoint or Equal-Length Errors;2024-01-17

3. The Hamilton Compression of Highly Symmetric Graphs;Annals of Combinatorics;2023-12-13

4. Kneser Graphs Are Hamiltonian;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

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