On the np-completeness of certain network testing problems (Q3315441)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the np-completeness of certain network testing problems
scientific article

    Statements

    On the np-completeness of certain network testing problems (English)
    0 references
    0 references
    1984
    0 references
    0 references
    undirected graph
    0 references
    communication network
    0 references
    NP-hard
    0 references
    maximum matching
    0 references
    edge coloring
    0 references
    0 references