Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions (Q1944946): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2011.03.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087998687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gray code for permutations with a fixed number of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gray code for derangements / 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: Generation of Permutations by Adjacent Transposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / 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: Gray codes, loopless algorithm and partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loop-free Gray code algorithms for the set of compositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the loopless generation of binary tree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A loopless algorithm for generating the permutations of a multiset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452089 / rank
 
Normal rank

Latest revision as of 08:27, 6 July 2024

scientific article
Language Label Description Also known as
English
Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
scientific article

    Statements

    Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions (English)
    0 references
    0 references
    0 references
    0 references
    28 March 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial problems
    0 references
    Gray codes
    0 references
    loop-free algorithms
    0 references
    partitions
    0 references
    e-restricted growth functions
    0 references
    0 references