A loop-free algorithm for generating the linear extensions of a poset (Q1917670): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting linear extensions / 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: Q5672651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Gray Codes / 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 translation of languages from left to right / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gray Code for the Ideals of a Forest Poset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Linear Extensions Fast / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552272 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:14, 24 May 2024

scientific article
Language Label Description Also known as
English
A loop-free algorithm for generating the linear extensions of a poset
scientific article

    Statements

    A loop-free algorithm for generating the linear extensions of a poset (English)
    0 references
    0 references
    0 references
    0 references
    4 November 1996
    0 references
    linear extension
    0 references
    \(\#P\)-complete
    0 references
    loop-free algorithm
    0 references
    poset-extension
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references