An Efficient Algorithm for Decomposition of Partially Ordered Sets

Table 7

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

N	Comparable pairs	Standard (P)	ILPM [7]		Proposed algorithm
			(P)	CPU time	(P)	CPU time
50	0	50	50	0.050901	50	0.003775
100	0	100	100	0.053883	100	0.009561
150	0	150	150	0.071736	150	0.015508
200	0	200	200	0.062894	200	0.024025
250	0	250	250	0.071185	250	0.04499
300	0	300	300	0.074197	300	0.063899
350	0	350	350	0.082339	350	0.089227
400	0	400	400	0.085237	400	0.158079
450	0	450	450	0.090219	450	0.257679
500	0	500	500	0.162822	500	0.388347