Some Hamilton Paths and a Minimal Change Algorithm
From MaRDI portal
Publication:3028353
DOI10.1145/2422.322413zbMath0625.68046OpenAlexW2057436596MaRDI QIDQ3028353
Ronald C. Read, Michael Hickey, Peter Eades
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
Hamilton pathcombinationscombinatorial configurationsminimal change algorithmgeneration of k-subsetsminimal changes
Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Related Items (16)
On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains ⋮ 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 ⋮ A generalized permutahedron ⋮ On a Combinatorial Generation Problem of Knuth ⋮ Star transposition Gray codes for multiset permutations ⋮ Trimming and gluing Gray codes ⋮ Hamiltonian intervals in the lattice of binary paths ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Rainbow Cycles in Flip Graphs ⋮ Solution of some multi-dimensional lattice path parity difference recurrence relations ⋮ A constant-time algorithm for middle levels Gray codes ⋮ The coolest way to generate combinations ⋮ Rainbow Cycles in Flip Graphs. ⋮ An algorithm for generating subsets of fixed size with a strong minimal change property
This page was built for publication: Some Hamilton Paths and a Minimal Change Algorithm
