Robust algorithms for the stable set problem
From MaRDI portal
Publication:1411110
DOI10.1007/s00373-002-0517-5zbMath1029.68115MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
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, Solving Problems on Graphs of High Rank-Width