Max-flow min-cut theorems on dispersion and entropy measures for communication networks (Q2417851)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Max-flow min-cut theorems on dispersion and entropy measures for communication networks |
scientific article |
Statements
Max-flow min-cut theorems on dispersion and entropy measures for communication networks (English)
0 references
29 May 2019
0 references
communication networks
0 references
flow
0 references
information theory
0 references
logic
0 references
entropy
0 references
dispersion
0 references
0 references
