On finding augmenting graphs (Q955317): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2008.03.008 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Local transformations of graphs preserving independence number / 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: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The independence number of graphs with large odd girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets in two subclasses of banner-free graphs / 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 Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding augmenting chains in extensions of claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in \(P_5\)- and banner-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: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2008.03.008 / rank
 
Normal rank

Latest revision as of 09:47, 10 December 2024

scientific article
Language Label Description Also known as
English
On finding augmenting graphs
scientific article

    Statements

    On finding augmenting graphs (English)
    0 references
    0 references
    0 references
    19 November 2008
    0 references
    independent set
    0 references
    augmenting graph
    0 references
    polynomial-time algorithm
    0 references

    Identifiers