An Efficient Algorithm for Decomposition of Partially Ordered Sets

Table 5

A comparison between ILPM and the proposed algorithm on k-tower posets.

N	Comparable pairs N (N − 2)/2	Standard (P)	ILPM [7]		Proposed algorithm
			(P)	CPU time	(P)	CPU time
50	1200	2	2	4.095658	2	0.000384
100	4900	2	2	30.97442	2	0.000446
150	11100	2	2	61.27756	2	0.000363
200	19800	2	2	150.0762	2	0.000415
250	31000	2	2	140.8486	2	0.000642
300	44700	2	2	283.7612	2	0.000654
350	60900	2	2	415.9408	2	0.000629
400	79600	2	2	399.5216	2	0.000634
450	100800	2	2	2568.489	2	0.000843
500	124500	2	2	2789.078	2	0.000850