An algorithm to generate the ideals of a partial order (Q1086160): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6377(86)90071-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070280587 / rank
 
Normal rank

Revision as of 23:50, 19 March 2024

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