Pages that link to "Item:Q2457911"
From MaRDI portal
The following pages link to On a polynomial fractional formulation for independence number of a graph (Q2457911):
Displaying 7 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)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- On independent cliques and linear complementarity problems (Q2095085) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
- Some news about the independence number of a graph (Q4522461) (← links)