Pages that link to "Item:Q4522461"
From MaRDI portal
The following pages link to Some news about the independence number of a graph (Q4522461):
Displaying 11 items.
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem (Q2107015) (← links)
- The independence number of the orthogonality graph in dimension \(2^k\) (Q2300165) (← links)
- On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
- Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications (Q2392765) (← links)
- On a polynomial fractional formulation for independence number of a graph (Q2457911) (← links)
- Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
- Some news about oblique graphs (Q4786788) (← links)
- On Domination in Graphs (Q5316253) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)