Publication:5687256
From MaRDI portal
zbMath0864.90122MaRDI QIDQ5687256
Antonio Sassano, Carlo Mannino
Publication date: 9 June 1997
branch-and-bound; sparse graphs; clique projection; maximum cardinality stable set problem; edge projection
90C35: Programming involving graphs or networks
68R10: Graph theory (including graph drawing) in computer science
Related Items
A tutorial on branch and cut algorithms for the maximum stable set problem, Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering, Strong lift-and-project cutting planes for the stable set problem, A branch and cut solver for the maximum stable set problem, Stability preserving transformations of graphs, Chair-free Berge graphs are perfect, Struction revisited, Routing trains through a railway station based on a node packing model, Solving hard set covering problems, Fixed cardinality stable sets, The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope