An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs (Q5089613): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3081541876 / rank
 
Normal rank

Latest revision as of 09:18, 30 July 2024

scientific article; zbMATH DE number 7560036
Language Label Description Also known as
English
An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs
scientific article; zbMATH DE number 7560036

    Statements

    An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs (English)
    0 references
    0 references
    19 July 2022
    0 references
    bipartite graph
    0 references
    maximum weight bipartite matching
    0 references
    lower bound for weights of bipartite matching
    0 references
    combinatorial optimization
    0 references
    string matching
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references