An Efficient Algorithm for Decomposition of Partially Ordered Sets

Table 3

A comparison between ILPM and the proposed algorithm on crown posets.

N = 2n	Comparable pairs, N (N − 1)	Standard (P)	ILPM [7]		Proposed algorithm
			(P)	CPU time	(P)	CPU time
50	600	25	25	0.235665	25	0.0017501
100	2450	50	50	1.215363	50	0.0036623
150	5550	75	75	3.590369	75	0.0067241
200	9900	100	100	9.038238	100	0.0075052
250	15500	125	125	16.18856	125	0.010577
300	22350	150	150	27.90345	150	0.0135506
350	30450	175	175	43.35807	175	0.0184247
400	39800	200	200	69.64655	200	0.027318
450	50400	225	225	96.15276	225	0.0280215
500	62250	250	250	136.2815	250	0.0457993