A constant-time algorithm for middle levels Gray codes (Q2309469): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-019-00640-2 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2982014679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-time algorithm for middle levels Gray codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Combinatorial Gray Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3470467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of Permutations by Adjacent Transposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified loop-free algorithm for generating permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generation of the binary reflected gray code and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Hamilton Paths and a Minimal Change Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for generating subsets of fixed size with a strong minimal change property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent interchange generation of combinations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating binary trees using rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rotation graph of binary trees is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Rotations and the Generation of Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Tree Graph of a Matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gray codes with restricted density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit matchings in the middle levels of the Boolean lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magical Mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic combinatorics and the recent work of Peter Keevash / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Gray codes and the middle levels problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in the middle two layers of the discrete cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic matchings cannot form Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explicit 1-factorization in the middle of the Boolean lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prism over the middle-levels graph is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized middle-level problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of 2-factors in the middle layer of the discrete cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: An update on the middle levels problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the middle levels conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the middle levels theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Middle Levels Gray Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The antipodal layers problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser graphs are Hamiltonian for \(n\geq 3k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free Hamiltonian Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Kneser graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trimming and gluing Gray codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loopless Gray Code Enumeration and the Tower of Bucharest. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum-change version of the Chung-Feller theorem for Dyck paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographically least circular substrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Catalan Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3499247 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126984693 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-019-00640-2 / rank
 
Normal rank

Latest revision as of 22:50, 17 December 2024

scientific article
Language Label Description Also known as
English
A constant-time algorithm for middle levels Gray codes
scientific article

    Statements

    A constant-time algorithm for middle levels Gray codes (English)
    0 references
    0 references
    0 references
    0 references
    1 April 2020
    0 references
    middle levels conjecture
    0 references
    Gray code
    0 references
    Hamilton cycle
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers