Research Article
An Efficient Algorithm for Decomposition of Partially Ordered Sets
Table 6
A comparison between ILPM and the proposed algorithm on chain posets.
| | N | Comparable pairs, N (N − 1)/2 | Standard (P) | ILPM [7] | Proposed algorithm | | (P) | CPU time | (P) | CPU time |
| | 50 | 1225 | 1 | 1 | 5.407565 | 1 | 0.000338 | | 100 | 4950 | 1 | 1 | 17.2817 | 1 | 0.000384 | | 150 | 11175 | 1 | 1 | 57.52828 | 1 | 0.000414 | | 200 | 19900 | 1 | 1 | 58.09319 | 1 | 0.00046 | | 250 | 31125 | 1 | 1 | 91.68824 | 1 | 0.000555 | | 300 | 44850 | 1 | 1 | 146.893 | 1 | 0.000559 | | 350 | 61075 | 1 | 1 | 209.748 | 1 | 0.000653 | | 400 | 79800 | 1 | 1 | 301.1966 | 1 | 0.000845 | | 450 | 101025 | 1 | 1 | 2956.88 | 1 | 0.005727 | | 500 | 124750 | 1 | 1 | 3591.351 | 1 | 0.007079 |
|
|
