On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051269964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the independence number via the \(\vartheta\)-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum stable set formulations and heuristics based on continuous optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of semidefinite programs via nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with Stable Set Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sandwich theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Representation of the Matching Polytope Via Semidefinite Liftings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank

Latest revision as of 19:59, 24 June 2024

scientific article
Language Label Description Also known as
English
On extracting maximum stable sets in perfect graphs using Lovász's theta function
scientific article

    Statements

    On extracting maximum stable sets in perfect graphs using Lovász's theta function (English)
    0 references
    28 September 2006
    0 references
    maximum stable sets
    0 references
    Lovász's theta function
    0 references
    semidefinite programming
    0 references
    perfect graphs
    0 references
    0 references
    0 references

    Identifiers