A general exhaustive generation algorithm for Gray structures (Q995753): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975955357 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0703262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exhaustive generation of combinatorial objects by ECO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern matching for permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating functions for generating trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of trees and other combinatorial objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: ECO:a methodology for the enumeration of combinatorial objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial interpretations of \(q\)-analogs of Schröder numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gray code for derangements / 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: On the equivalence problem for succession rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of Baxter permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of Permutations by Adjacent Transposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating algebraic functions by means of rational ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating binary trees by transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gray visiting Motzkins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating trees and the Catalan and Schröder numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating trees and forbidden subsequences / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:09, 26 June 2024

scientific article
Language Label Description Also known as
English
A general exhaustive generation algorithm for Gray structures
scientific article

    Statements

    A general exhaustive generation algorithm for Gray structures (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 September 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references