An algorithm to generate the ideals of a partial order (Q1086160)

From MaRDI portal
Revision as of 17:10, 17 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An algorithm to generate the ideals of a partial order
scientific article

    Statements

    An algorithm to generate the ideals of a partial order (English)
    0 references
    0 references
    1986
    0 references
    Generating the ideals of a partially ordered set is an important, frequently occurring problem in scheduling, reliability, sensitivity analysis for network flows and other combinatorial optimization problems. In this paper we present an algorithm which generates all the ideals of a partial order on n elements in O(n) time per ideal.
    0 references
    ideals of a partially ordered set
    0 references

    Identifiers