Article ID Journal Published Year Pages File Type
1143222 Operations Research Letters 2007 9 Pages PDF
Abstract
We introduce a poly-time algorithm for the maximum weighted stable set problem, when a certain representation is given for a graph. The algorithm generalizes the algorithm for interval graphs and that for graphs with bounded pathwidth. By a suitable application to the frequency assignment problem, we improved several solutions to relevant benchmark instances.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The stable set problem and the thinness of a graph
Authors
, , , ,