Title of article
Weighted parameters in
Author/Authors
Vassilis Giakoumakis، نويسنده , , Irena Rusu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
7
From page
255
To page
261
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 (P5, P5)-free graph. As a by-product, we obtain an O(m + n) algorithm for finding a minimum weighted transversal of the C5 in a (P5, P5)-free graph.
Keywords
Weighted parameters , Perfect graphs , Modular decomposition
Journal title
Discrete Applied Mathematics
Serial Year
1996
Journal title
Discrete Applied Mathematics
Record number
884680
Link To Document