Vertices Belonging to All or to No Maximum Stable Sets of a Graph (Q3960467): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Integer Programming: Methods, Uses, Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularisable graphs I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularisable graphs, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Problems and Hypergraph Theory: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4060999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the integer-valued variables in the linear vertex packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum node covers and 2-bicritical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factors of Graphs / rank
 
Normal rank

Latest revision as of 17:09, 13 June 2024

scientific article
Language Label Description Also known as
English
Vertices Belonging to All or to No Maximum Stable Sets of a Graph
scientific article

    Statements

    Vertices Belonging to All or to No Maximum Stable Sets of a Graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    0 references
    set of optimal solutions
    0 references
    maximum weighted stable set problem
    0 references
    continuous relaxation
    0 references
    0 references