An Efficient Algorithm for Decomposition of Partially Ordered Sets

Table 4

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

N	Comparable pairs <N	Standard (P)	ILPM [7]		Proposed algorithm
			(P)	CPU time	(P)	CPU time
50	12	2	2	0.043329	2	0.0002642
100	27	3	3	0.047882	3	0.0003259
150	42	4	4	0.054162	4	0.0003274
200	48	3	3	0.059799	3	0.0002829
250	22	2	2	0.055196	2	0.0002299
300	90	5	5	0.070541	5	0.0004843
350	42	4	4	0.054761	4	0.0006213
400	75	3	3	0.065461	3	0.0002782
450	90	5	5	0.070376	5	0.0004512
500	48	3	3	0.05527	3	0.0002953