From matchings to independent sets (Q2403787): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Crown structures for vertex cover kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On easy and hard hereditary classes of graphs with respect to the independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithm for finding the largest independent sets in graphs without forks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting graphs for independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Struction revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with polynomially solvable maximum-weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of derived graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / 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: Q3682509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path parity and perfection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On diameters and radii of bridged graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure & conquer approach for the analysis of exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A transformation which preserves the clique number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting chains in graphs without a skew star. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of Boolean methods for the computation of the stability number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A magnetic procedure for the stability number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability preserving transformations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding augmenting graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in extensions of 2\(K_{2}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum regular induced subgraphs in \(2P_3\)-free graphs / 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 in certain \(P_6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing independent sets in graphs with large girth / 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: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank

Revision as of 08:59, 14 July 2024

scientific article
Language Label Description Also known as
English
From matchings to independent sets
scientific article

    Statements

    From matchings to independent sets (English)
    0 references
    0 references
    12 September 2017
    0 references
    maximum matching
    0 references
    maximum independent set
    0 references
    polynomial algorithm
    0 references
    0 references
    0 references
    0 references

    Identifiers