Adjacent interchange generation of combinations

DOI10.1016/0196-6774(88)90036-3MaRDI QIDQ5203008zbMATH OpenOpenAlexFDO

Authors Frank Ruskey

Publication date 1988

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(88)90036-3

zbMATH Keywords

adjacent interchangeadjacent interchange algorithmadjacent interchanging graphHamiltonian paths

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Eulerian and Hamiltonian graphs (05C45) Combinatorial codes (94B25)

Recommendations

• scientific article; zbMATH DE number 4106841
• Generating permutations of a bag by interchanges
• Generating binary trees by transpositions
• Interchange graphs and the Hamiltonian cycle polytope
• Some Hamilton Paths and a Minimal Change Algorithm

Cited in

(28)

• Gray codes, loopless algorithm and partitions
• Generating permutations of a bag by interchanges
• A simple systolic algorithm for generating combinations in lexicographic order
• On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains
• Finding parity difference by involutions
• Trimming and gluing Gray codes
• Gray code enumeration of families of integer partitions
• A generalized permutahedron
• A constant-time algorithm for middle levels Gray codes
• Generating linear extensions of posets by transpositions
• Some Hamilton Paths and a Minimal Change Algorithm
• Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
• Efficient Computation of Middle Levels Gray Codes
• scientific article; zbMATH DE number 4106841 (Why is no real title available?)
• scientific article; zbMATH DE number 706769 (Why is no real title available?)
• Efficient computation of statistical procedures based on all subsets of a specified size
• The coolest way to generate binary strings
• On a combinatorial generation problem of Knuth
• Rainbow cycles in flip graphs
• Rainbow cycles in flip graphs
• An optimal parallel algorithm for generating combinations
• A minimum-change version of the Chung-Feller theorem for Dyck paths
• A minimum-change version of the Chung-Feller theorem for Dyck paths
• Star transposition Gray codes for multiset permutations
• Kneser graphs are Hamiltonian
• Kneser graphs are Hamiltonian
• Transposition generation of alternating permutations
• A loop-free two-close Gray-code algorithm for listing k-ary Dyck words

This page was built for publication: Adjacent interchange generation of combinations

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