Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks (Q3922167)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks
scientific article

    Statements

    Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks (English)
    0 references
    0 references
    0 references
    1981
    0 references
    NP-complete
    0 references
    flow control
    0 references
    routing
    0 references
    computer network
    0 references
    communication network
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references