An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs (Q5682014)

From MaRDI portal
Revision as of 23:01, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3419167
Language Label Description Also known as
English
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
scientific article; zbMATH DE number 3419167

    Statements

    An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs (English)
    0 references
    0 references
    0 references
    0 references
    1973
    0 references
    0 references
    0 references
    0 references