Improving an upper bound on the stability number of a graph (Q556012): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-004-6536-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021053327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On standard quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic programming approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Characterizations of the Maximum Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interlacing eigenvalues and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / 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: On hereditary properties of the class of graphs with convex quadratic stability number / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the independence number of a graph computable in polynomial-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic programming approach to the determination of an upper bound on the weighted stability number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank

Latest revision as of 12:23, 10 June 2024

scientific article
Language Label Description Also known as
English
Improving an upper bound on the stability number of a graph
scientific article

    Statements

    Improving an upper bound on the stability number of a graph (English)
    0 references
    0 references
    13 June 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    graph theory
    0 references
    maximum stable set
    0 references
    quadratic programming
    0 references
    0 references