The capacity of the subarray partial concentrators

DOI10.1016/0166-218X(92)90178-DzbMath0765.05078OpenAlexW1994442543MaRDI QIDQ1201810

G. W. Richards, Frank K. Hwang

Publication date: 17 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90178-d

zbMATH Keywords

bipartite graphLatin squarescapacityperfect matchingpartial concentratorsubarray

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

An improved upper bound for the subarray partial concentrators

Cites Work

• Unnamed Item
• Using combinatorial designs to construct partial concentrators
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• Binomial Switching Networks for Concentration and Distribution

This page was built for publication: The capacity of the subarray partial concentrators