A faster algorithm for cuckoo insertion and bipartite matching in large graphs (Q2319642)

From MaRDI portal
Revision as of 06:14, 20 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A faster algorithm for cuckoo insertion and bipartite matching in large graphs
scientific article

    Statements

    title
    A faster algorithm for cuckoo insertion and bipartite matching in large graphs (English)
    0 references
    author
    Megha Khosla
    0 references
    Avishek Anand
    0 references
    published in
    Algorithmica
    0 references
    publication date
    20 August 2019
    0 references
    zbMATH Keywords
    cuckoo hashing
    0 references
    bipartite matching
    0 references
    load balancing
    0 references

    Identifiers

    zbMATH DE Number
    7096144
    0 references
    OpenAlex ID
    W2551095121
    0 references
    arXiv ID
    1611.07786
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2319642&oldid=36517672"
    Powered by MediaWiki