The capacity of the subarray partial concentrators (Q1201810)
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: The capacity of the subarray partial concentrators |
scientific article; zbMATH DE number 98502
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The capacity of the subarray partial concentrators |
scientific article; zbMATH DE number 98502 |
Statements
The capacity of the subarray partial concentrators (English)
0 references
17 January 1993
0 references
A partial concentrator with parameters \(m,n\) and \(c\), is an \(n\) (inputs)\(\times m\) (outputs) bipartite graph such that any set of \(k\) inputs, \(k\leq c\), has a perfect matching to some set of \(k\) outputs. The authors construct partial concentrators with the aid of Latin squares.
0 references
capacity
0 references
subarray
0 references
bipartite graph
0 references
perfect matching
0 references
partial concentrator
0 references
Latin squares
0 references
