Generating linear extensions of posets by transpositions (Q2368024): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0095-8956(92)90067-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052085947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gray codes with restricted density / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Jump Number of Dags and Posets: An Introduction / 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: Minimizing bumps in linear extensions of ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of Permutations by Adjacent Transposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generation of all topological sortings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic permutations with restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structured program to generate all topological sorting arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of some multi-dimensional lattice path parity difference recurrence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation by Adjacent Interchanges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating the Linear Extensions of Certain Posets by Transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Linear Extensions by Interchanging Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4207901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent interchange generation of combinations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transposition generation of alternating permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating binary trees by transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3676161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to generate all topological sorting arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing bumps for posets of width two / rank
 
Normal rank

Latest revision as of 18:33, 17 May 2024

scientific article
Language Label Description Also known as
English
Generating linear extensions of posets by transpositions
scientific article

    Statements

    Generating linear extensions of posets by transpositions (English)
    0 references
    0 references
    18 August 1993
    0 references
    See the preview in Zbl 0697.06001.
    0 references
    0 references
    0 references
    0 references
    0 references
    linear extensions
    0 references
    forest
    0 references
    disjoint chains
    0 references
    transposition
    0 references
    Hamiltonian cycle
    0 references
    0 references