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

From MaRDI portal
Revision as of 09:29, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/siamcomp/HopcroftK73, #quickstatements; #temporary_batch_1731483406851)
(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
    1973
    0 references

    Identifiers