Pages that link to "Item:Q1584341"
From MaRDI portal
The following pages link to A lower bound on the independence number of a graph (Q1584341):
Displaying 10 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
- The \(k\)-regular induced subgraph problem (Q1786867) (← links)
- On a polynomial fractional formulation for independence number of a graph (Q2457911) (← links)
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
- Rank and chromatic number of a graph (Q4355066) (← links)
- Two faces of greedy leaf removal procedure on graphs (Q5132111) (← links)
- New analytical lower bounds on the clique number of a graph (Q5268926) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
- Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs (Q5958808) (← links)
