An Efficient Algorithm for Decomposition of Partially Ordered Sets

Table 2

A comparison between ILPM and the proposed algorithm on 2n-cycle.

N = 2n	Comparable pairs, N	Standard (P)	ILPM		Proposed algorithm
			(P)	CPU time	(P)	CPU time
50	50	25	25	0.089045	25	0.002301
100	100	50	50	0.106691	50	0.0043507
150	150	75	75	0.165378	75	0.0081102
200	200	100	100	0.239956	100	0.0108141
250	250	125	125	0.431634	125	0.016587
300	300	150	150	0.474245	150	0.0246753
350	350	175	175	0.622573	175	0.0349737
400	400	200	200	0.756483	200	0.0705701
450	450	225	225	0.948467	225	0.0999672
500	500	250	250	1.216359	250	0.1508073