Some Hamilton Paths and a Minimal Change Algorithm

DOI10.1145/2422.322413MaRDI QIDQ3028353zbMATH OpenOpenAlexFDO

Authors Peter Eades, Michael Hickey, Ronald C. Read

Publication date 1984

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2422.322413

zbMATH Keywords

combinationscombinatorial configurationsgeneration of k-subsetsHamilton pathminimal change algorithmminimal changes

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Paths and cycles (05C38) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Combinatorial Algorithms for Listing Paths in Minimal Change Order
• Adjacent interchange generation of combinations
• Algorithms for the optimal Hamiltonian path in Halin graphs
• scientific article; zbMATH DE number 4031743
• An algorithm for finding Hamilton paths and cycles in random graphs

Cited in

(25)

• The coolest way to generate combinations
• An algorithm for generating subsets of fixed size with a strong minimal change property
• Solution of some multi-dimensional lattice path parity difference recurrence relations
• On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains
• Finding parity difference by involutions
• Hamiltonian chains in orgraphs
• Trimming and gluing Gray codes
• A generalized permutahedron
• A constant-time algorithm for middle levels Gray codes
• The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations
• Generating linear extensions of posets by transpositions
• An Eades-McKay algorithm for well-formed parentheses strings
• scientific article; zbMATH DE number 3981183 (Why is no real title available?)
• scientific article; zbMATH DE number 6850346 (Why is no real title available?)
• On a combinatorial generation problem of Knuth
• Rainbow cycles in flip graphs
• Adjacent interchange generation of combinations
• Rainbow cycles in flip graphs
• Combinatorial Algorithms for Listing Paths in Minimal Change Order
• A minimum-change version of the Chung-Feller theorem for Dyck paths
• Star transposition Gray codes for multiset permutations
• Hamiltonian intervals in the lattice of binary paths
• Kneser graphs are Hamiltonian
• Flips in colorful triangulations
• Kneser graphs are Hamiltonian

This page was built for publication: Some Hamilton Paths and a Minimal Change Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028353)