Augmenting approach for some maximum set problems (Q284765): 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: Q5463498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(k\)-path vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum \(k\)-regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On F-independence in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion NP-Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximum induced matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding augmenting graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on graphs without long induced paths / 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: Stable sets for (P_{6}, K_{2,3})-free graphs / 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
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank

Latest revision as of 23:50, 11 July 2024

scientific article
Language Label Description Also known as
English
Augmenting approach for some maximum set problems
scientific article

    Statements

    Augmenting approach for some maximum set problems (English)
    0 references
    0 references
    18 May 2016
    0 references
    node-deletion problem
    0 references
    independent set
    0 references
    dissociative set
    0 references
    vertex \(k\)-path cover
    0 references
    feedback vertex cover
    0 references
    induced matching
    0 references
    \(k\)-regular induced subgraph
    0 references
    augmenting graph
    0 references

    Identifiers