论文信息 - Weighted Parameters in (P5, P5)-free Graphs

Weighted Parameters in (P5, P5)-free Graphs

Abstract We use the modular decomposition to give O(n(m + n) algorithms for finding a maximum weighted clique (respectively stable set) and an approximate weighted colouring (respectively partition into cliques) in a (P 5 , P 5 )- free graph. As a by-product, we obtain an O(m + n) algorithm for finding a minimum weighted transversal of the C5 in a (P 5 , P 5 )- free graph.

Vassilis Giakoumakis | Irena Rusu | V. Giakoumakis | I. Rusu

[1] Jens Gustedt,et al. Efficient and practical modular decomposition , 1997, SODA '97.

[2] Rolf H. Möhring,et al. A Fast Algorithm for the Decomposition of Graphs and Posets , 1983, Math. Oper. Res..

[3] Frederic Maire,et al. On graphs without P5 and P5_ , 1995, Discret. Math..

[4] Stephan Olariu,et al. A charming class of perfectly orderable graphs , 1992, Discret. Math..

[5] Chính T. Hoàng,et al. Efficient Algorithms for Minimum Weighted Colouring of Some Classes of Perfect Graphs , 1994, Discret. Appl. Math..

[6] Michel Habib,et al. A New Linear Algorithm for Modular Decomposition , 1994, CAAP.

[7] L. Lovász,et al. Polynomial Algorithms for Perfect Graphs , 1984 .