Finding Perfect Matchings in Bipartite Hypergraphs (Q4575710)

From MaRDI portal
Revision as of 16:02, 31 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Item:Q4575710
scientific article; zbMATH DE number 6904003
Language Label Description Also known as
English
Finding Perfect Matchings in Bipartite Hypergraphs
scientific article; zbMATH DE number 6904003

    Statements

    Finding Perfect Matchings in Bipartite Hypergraphs (English)
    0 references
    16 July 2018
    0 references
    bipartite hypergraphs
    0 references
    local search algorithms
    0 references
    matchings
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references