The struction algorithm for the maximum stable set problem revisited

DOI10.1016/0012-365X(94)90377-8zbMath0813.68143OpenAlexW1997687746MaRDI QIDQ1332429

K. W. Hoke, M. F. Troyon

Publication date: 28 May 1995

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90377-8

zbMATH Keywords

claw-free graphsstruction method

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Boolean functions (06E30)

Related Items

Struction revisited ⋮ Stability preserving transformations of graphs ⋮ Pseudo-Boolean optimization ⋮ Local transformations of graphs preserving independence number

Cites Work

• Stability in CAN-free graphs
• On rigid circuit graphs
• The struction of a graph: Application to CN-free graphs
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• The basic algorithm for pseudo-Boolean programming revisited
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item