Pages that link to "Item:Q3596359"
From MaRDI portal
The following pages link to On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem (Q3596359):
Displaying 10 items.
- On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) (← links)
- Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs (Q2463465) (← links)
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- (Q3035321) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)