An NP-complete matching problem (Q1166935)

From MaRDI portal
Revision as of 05:44, 5 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q106200605, #quickstatements; #temporary_batch_1712286835472)
scientific article
Language Label Description Also known as
English
An NP-complete matching problem
scientific article

    Statements

    An NP-complete matching problem (English)
    0 references
    1980
    0 references
    0 references
    0 references
    0 references
    0 references
    restricted form of the perfect matching problem for bipartite graphs
    0 references
    partitions of the vertices of the graph
    0 references
    degrees of the vertices
    0 references
    polynomial time algorithm
    0 references
    0 references
    0 references
    0 references