Efficiently implementing maximum independent set algorithms on circle graphs

ABSTRACT

Circle graphs are an important class of graph with applications in a number of areas, including compiler optimization, VLSI design and computational geometry. In this article, we provide an experimental evaluation of the two most efficient algorithms for computing the maximum independent set of a circle graph. We provide details of our implementations of the algorithms of Apostolico et al. and Valiente [2003], together with time, space, and other measurements. We describe optimizations to the algorithm of Apostolico et al. that significantly reduce both its running time and its memory consumption. We also correct an error in this algorithm. In addition, we show how to restructure and simplify Valiente's algorithm, allowing us to remove redundant computations from the algorithm resulting in much improved performance. Moreover, in the case of both algorithms, when the density of the circle graph's associated interval representation is increased beyond a certain point the efficacy of the optimizations we apply increases dramatically and as a function of the density. We provide experimental results over dense and sparse random circle graphs, as well as for circle graphs that arise when performing register allocation of software pipelined loops in a compiler.

REFERENCES

• 1: Alberto Apostolico , Mikhail J. Atallah , Susanne E. Hambrusch, New clique and independent set algorithms for circle graphs, Discrete Applied Mathematics, v.36 n.1, p.1-24, March 30, 1992 [doi>10.1016/0166-218X(92)90200-T]
• 2: Alberto Apostolico , Mikhail J. Atallah , Susanne E. Hambrusch, New clique and independent set algorithms for circle graphs, Discrete Applied Mathematics, v.36 n.1, p.1-24, March 30, 1992 [doi>10.1016/0166-218X(92)90200-T]
• 3: Takao Asano , Tetsuo Asano , Hiroshi Imai, Partitioning a polygonal region into trapezoids, Journal of the ACM (JACM), v.33 n.2, p.290-312, April 1986 [doi>10.1145/5383.5387]
• 4: Asano, T., Imai, H., and Mukaiyama, A. 1991. Finding a maximum weight independent set of a circle graph. IEICE Transactions E74, 4, 681--683.
• 5: Cong, J. and Liu, C. L. 1990. Over-the-cell channel routing. IEEE Trans. on CAD of Integrated Circuits and Systems 9, 4, 408--418.
• 6: D. de Werra , Ch. Eisenbeis , S. Lelait , B. Marmol, On a graph-theoretical model for cyclic register allocation, Discrete Applied Mathematics, v.93 n.2-3, p.191-203, July 20, 1999 [doi>10.1016/S0166-218X(99)00105-5]
• 7: de Werra, D., Eisenbeis, C., Lelait, S., and Stöhr, E. 2002. Circular-arc graph coloring: on chords and circuits in the meeting graph. European Journal of Oper. Research 136, 483--500.
• 8: Christine Eisenbeis , Sylvain Lelait , Bruno Marmol, The meeting graph: a new model for loop cyclic register allocation, Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques, p.264-267, June 27-29, 1995, Limassol, Cyprus
• 9: Gavril, F. 1973. Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks 3, 3, 261--273.
• 10: Goldschmidt, O. and Takvorian, A. 1994. An efficient algorithm for finding a maximum weight independent set of a circle graph. IEICE Transactions E77-A, 10, 1672--1674.
• 11: Gupta, U. I., Lee, D. T., and Leung, J. Y.-T. 1982. Efficient algorithms for interval graphs and circular-arc graphs. Networks 12, 4, 459--467.
• 12: Robin Liu , Simeon Ntafos, On decomposing polygons into uniformly monotone parts, Information Processing Letters, v.27 n.2, p.85-89, February 29, 1988 [doi>10.1016/0020-0190(88)90097-X]
• 13: Scheinerman, E. R. 1988. Random interval graphs. Combinatorica 8, 4, 357--371.
• 14: E. R. Scheinerman, An evolution of interval graphs, Discrete Mathematics, v.82 n.3, p.287-302, Jun. 1990 [doi>10.1016/0012-365X(90)90206-W]
• 15: Supowit, K. J. 1987. Finding a maximum planar subset of a set of nets in a channel. IEEE Trans. on CAD of Integrated Circuits and Systems 6, 1, 93--94.
• 16: Valiente, G. 2003. A new simple algorithm for the maximum-weight independent set problem on circle graphs. In ISAAC, T. Ibaraki, N. Katoh, and H. Ono, Eds. Lecture Notes in Computer Science, vol. 2906. Springer, 129--137.

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory

General Terms:
Algorithms, Experimentation, Measurement, Performance

Keywords:
Circle graph, maximum independent set, maximum stable set