论文信息 - Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization

Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization

Abstract. For a set S of intervals, the clique-intervaIS is defined as the interval obtained from the intersection of all the intervals in S , and the clique-width quantity wS is defined as the length of IS . Given a set S of intervals, it is straightforward to compute its clique-interval and clique-width. In this paper we study the problem of partitioning a set of intervals in order to maximize the sum of the clique-widths of the partitions. We present an O(n log n) time algorithm for the balanced bipartitioning problem, and an O(k n2) time algorithm for the k -way unbalanced partitioning problem.

[1] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] Majid Sarrafzadeh,et al. System partitioning to maximize sleep time , 1995, ICCAD.

[4] Majid Sarrafzadeh,et al. Maximum independent set of a permutation graph in K tracks , 1993, Int. J. Comput. Geom. Appl..

[5] Majid Sarrafzadeh,et al. Exploiting Sleep Mode for Memory Partitioning and Other Applications , 1998, VLSI Design.

[6] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .