Pages that link to "Item:Q1894362"
From MaRDI portal
The following pages link to Polynomially solvable cases for the maximum stable set problem (Q1894362):
Displayed 17 items.
- Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization (Q537589) (← links)
- Stability preserving transformations of graphs (Q646718) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Augmenting graphs for independent sets (Q705491) (← links)
- On the use of Boolean methods for the computation of the stability number (Q1363750) (← links)
- Struction revisited (Q1414580) (← links)
- Stability in \(P_5\)- and banner-free graphs (Q1580977) (← links)
- On the stable set problem in special \(P_{5}\)-free graphs (Q1861559) (← links)
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs (Q1922632) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- Augmenting chains in graphs without a skew star. (Q2490836) (← links)
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
- (Q4229265) (← links)
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems (Q5737720) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
- A note on \(\alpha\)-redundant vertices in graphs (Q5929313) (← links)