An algorithm to generate the ideals of a partial order (Q1086160)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm to generate the ideals of a partial order |
scientific article; zbMATH DE number 3984978
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to generate the ideals of a partial order |
scientific article; zbMATH DE number 3984978 |
Statements
An algorithm to generate the ideals of a partial order (English)
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
0 references
