Pages that link to "Item:Q1336674"
From MaRDI portal
The following pages link to A probabilistic lower bound on the independence number of graphs (Q1336674):
Displayed 12 items.
- Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- A lower bound on the independence number of a graph (Q1584341) (← links)
- A note on greedy algorithms for the maximum weighted independent set problem (Q1861582) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- On Selkow's bound on the independence number of graphs (Q2416950) (← links)
- Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives (Q2421880) (← links)
- Partitions of graphs into small and large sets (Q2446835) (← links)
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
- The potential of greed for independence (Q4650180) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
- Simple and local independent set approximation (Q5919021) (← links)