A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks (Q5280941)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks |
scientific article; zbMATH DE number 6753470
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks |
scientific article; zbMATH DE number 6753470 |
Statements
A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks (English)
0 references
27 July 2017
0 references
