The stable set problem and the thinness of a graph

Authors:
Carlo Mannino;Gianpaolo Oriolo;Federico Ricci;Sunil Chandran
Affiliations:
Dip. di Informatica e Sistemistica, Universita di Roma, 'La Spapienza', Via Bounarroti 12, I-00185 Roma, Italy;Dip. di Informatica e Sistemistica, Universita di Roma, 'La Spapienza', Via Bounarroti 12, I-00185 Roma, Italy;Dip. di Informatica e Sistemistica, Universita di Roma, 'La Spapienza', Via Bounarroti 12, I-00185 Roma, Italy;Dip. di Informatica e Sistemistica, Universita di Roma, 'La Spapienza', Via Bounarroti 12, I-00185 Roma, Italy
Venue:
Operations Research Letters
Year:
2007

Citing 4
Cited 3

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
A unified approach to domination problems on interval graphs

Information Processing Letters
An optimal greedy heuristic to color interval graphs

Information Processing Letters
An efficient algorithm for finding a maximum weight 2-independent set on interval graphs

Information Processing Letters

Heuristic manipulation, tabu search and frequency assignment

Computers and Operations Research
A Lagrangian heuristic for satellite range scheduling with resource constraints

Computers and Operations Research
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.