An algorithm to generate the ideals of a partial order (Q1086160): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:58, 31 January 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
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
