Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets (Q2412632)

From MaRDI portal
Revision as of 21:33, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
scientific article

    Statements

    Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets (English)
    0 references
    0 references
    0 references
    24 October 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    minor embedding
    0 references
    adiabatic quantum computing
    0 references
    quantum annealing
    0 references
    Clique minor
    0 references
    graph theory
    0 references