Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks (Q3922167)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3735137
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks |
scientific article; zbMATH DE number 3735137 |
Statements
Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks (English)
0 references
1981
0 references
NP-complete
0 references
flow control
0 references
routing
0 references
computer network
0 references
communication network
0 references
