Pages that link to "Item:Q1029074"
From MaRDI portal
The following pages link to Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes (Q1029074):
Displaying 8 items.
- On minimal prime extensions of a four-vertex graph in a prime graph (Q704276) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Stability number of bull- and chair-free graphs (Q1208469) (← links)
- The exact weighted independent set problem in perfect graphs and related classes (Q2840556) (← links)
- Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)
- (Q4691867) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)