Robust algorithms for the stable set problem

DOI10.1007/S00373-002-0517-5zbMath1029.68115OpenAlexW2302874537MaRDI QIDQ1411110

Michael U. Gerber, Vadim V. Lozin

Publication date: 16 October 2003

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-002-0517-5

zbMATH Keywords

robust algorithms

Mathematics Subject Classification ID

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

Related Items (7)

Solving Problems on Graphs of High Rank-Width ⋮ On independent vertex sets in subclasses of apple-free graphs ⋮ New applications of clique separator decomposition for the maximum weight stable set problem ⋮ Stable sets in two subclasses of banner-free graphs ⋮ Solving problems on graphs of high rank-width ⋮ Extending the MAX algorithm for maximum independent set ⋮ New sufficient conditions for \(\alpha\)-redundant vertices

This page was built for publication: Robust algorithms for the stable set problem