Conic reduction of graphs for the stable set problem

DOI10.1016/S0012-365X(99)00408-2zbMath0962.05057OpenAlexW2052323627MaRDI QIDQ1579563

Vadim V. Lozin

Publication date: 12 March 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00408-2

zbMATH Keywords

stability numberpolynomial algorithmgraph transformationsmaximum stable set problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Struction revisited ⋮ Stability preserving transformations of graphs ⋮ Structure and stability number of chair-, co-P- and gem-free graphs revisited ⋮ Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes

This page was built for publication: Conic reduction of graphs for the stable set problem