The stable set problem and the thinness of a graph

DOI10.1016/j.orl.2006.01.009zbMath1121.05113MaRDI QIDQ2643810

Carlo Mannino, L. Sunil Chandran, Gianpaolo Oriolo, Federico Ricci

Publication date: 27 August 2007

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2108/12084

zbMATH Keywords

stable set; pathwidth; frequency assignment; thinness

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem, A Lagrangian heuristic for satellite range scheduling with resource constraints, Heuristic manipulation, tabu search and frequency assignment

Uses Software

• CALMA

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of very large-scale neighborhood search techniques
• An optimal greedy heuristic to color interval graphs
• A unified approach to domination problems on interval graphs
• An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
• A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
• Efficient algorithms for interval graphs and circular-arc graphs
• Models and solution techniques for frequency assignment problems