Algorithms for Degree Constrained Graph Factors of Minimum Deficiency (Q4033760)

From MaRDI portal
Revision as of 20:06, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
scientific article

    Statements

    Algorithms for Degree Constrained Graph Factors of Minimum Deficiency (English)
    0 references
    16 May 1993
    0 references
    minimum deficiency
    0 references
    \((g,f)\)-factor
    0 references
    \(g\)-deficiency
    0 references
    perfect matching
    0 references
    efficient algorithm
    0 references
    bipartite matching algorithm
    0 references
    complexity
    0 references
    upper bounds
    0 references
    maximum flow problem
    0 references
    bipartite graphs
    0 references
    complexity bounds
    0 references
    maximum flow algorithms
    0 references
    NP-hard
    0 references
    0 references
    0 references

    Identifiers

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