Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ORDER

2008

2008

Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for every poset P = (X, ) and every integer k 2, there exists an ordered partition of P into k parts such that the total number of comparable pairs within the parts is at most (m - 1)/k, where m 1 is the total number of edges in the comparability graph of P. We show that this bound is best possible for k = 2, but we give an improved bound, m/k - c(k) m, for k 3, where c(k) is a constant depending only on k. We also show that, given a poset P = (X, ), we can find an ordered partition of P that minimises the total number of comparable pairs within parts in polynomial time. We prove more general, weighted versions of these results.

Related Content

Added |
14 Dec 2010 |

Updated |
14 Dec 2010 |

Type |
Journal |

Year |
2008 |

Where |
ORDER |

Authors |
Viresh Patel |

Comments (0)