A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs (Q4973052)

From MaRDI portal
scientific article; zbMATH DE number 7138986
Language Label Description Also known as
English
A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs
scientific article; zbMATH DE number 7138986

    Statements

    A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs (English)
    0 references
    0 references
    0 references
    0 references
    2 December 2019
    0 references
    minimum-cost matching
    0 references
    primal-dual
    0 references
    scaling algorithms
    0 references

    Identifiers

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