Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Andreas Brandstädt, Chính T. Hoàng. On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem. Theoretical Computer Science, 389(1-2):295-306, 2007. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set ProblemAndreas Brandstädt, Chính T. Hoàng. ipco 2005: 265-275 [doi] New applications of clique separator decomposition for the Maximum Weight Stable Set problemAndreas Brandstädt, Van Bang Le, Suhail Mahfud. TCS, 370(1-3):229-239, 2007. [doi] New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set ProblemAndreas Brandstädt, Van Bang Le, Suhail Mahfud. fct 2005: 516-527 [doi] On Robust Algorithms for the Maximum Weight Stable Set ProblemAndreas Brandstädt. fct 2001: 445-458 [doi]
The following publications are possibly variants of this publication: