An 0(n log n) algorithm for the convex bipartite matching problem (Q792885)

From MaRDI portal
Revision as of 17:42, 5 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An 0(n log n) algorithm for the convex bipartite matching problem
scientific article

    Statements

    An 0(n log n) algorithm for the convex bipartite matching problem (English)
    0 references
    0 references
    1984
    0 references
    maximum cardinality matching problem
    0 references
    convex bipartite graphs
    0 references
    special data structure
    0 references
    binary heap
    0 references

    Identifiers

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