Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs (Q290201): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of generalized clique packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: New classes of Berge perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability number of bull- and chair-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Approach to a Class of Integer-Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of comparability graph recognition and coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / 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: Q4770411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank

Latest revision as of 01:56, 12 July 2024

scientific article
Language Label Description Also known as
English
Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
scientific article

    Statements

    Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs (English)
    0 references
    0 references
    1 June 2016
    0 references
    polynomial algorithms
    0 references
    combinatorial problems
    0 references
    computational complexity
    0 references
    stable set
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references