Some Hamilton Paths and a Minimal Change Algorithm

Authors:
Peter Eades;Michael Hickey;Ronald C. Read
Affiliations:
Department of Computer Science, University of Queensland, St. Lucia, Queensland, Australia 4067;Department of Computer Science, University of Queensland, St. Lucia, Queensland, Australia 4067;Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
Venue:
Journal of the ACM (JACM)
Year:
1984

Citing 4
Cited 2

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

Journal of the ACM (JACM)
Three new combination algorithms with the minimal change property

Communications of the ACM
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice
Graph Theory With Applications

Graph Theory With Applications

An explicit universal cycle for the (n-1)-permutations of an n-set

ACM Transactions on Algorithms (TALG)
Generating combinations by prefix shifts

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract