Pages that link to "Item:Q2506178"
From MaRDI portal
The following pages link to On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178):
Displaying 10 items.
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (Q844531) (← links)
- A simpler characterization of a spectral lower bound on the clique number (Q966428) (← links)
- Maximum stable set formulations and heuristics based on continuous optimization (Q1396818) (← links)
- On the Lovász theta function and some variants (Q1751239) (← links)
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation (Q2025063) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- An SDP primal-dual algorithm for approximating the Lovász-theta function (Q2249741) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710809) (← links)
- On different versions of the exact subgraph hierarchy for the stable set problem (Q6585245) (← links)