A reduction algorithm for the weighted stable set problem in claw-free graphs (Q2448908): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strengthening of Ben Rebea's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank

Latest revision as of 11:20, 8 July 2024

scientific article
Language Label Description Also known as
English
A reduction algorithm for the weighted stable set problem in claw-free graphs
scientific article

    Statements

    A reduction algorithm for the weighted stable set problem in claw-free graphs (English)
    0 references
    0 references
    0 references
    5 May 2014
    0 references
    claw-free graphs
    0 references
    stable set
    0 references
    clique reduction
    0 references
    matching
    0 references
    augmenting path
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references