Using combinatorial designs to construct partial concentrators

DOI10.1109/26.87219zbMath0728.05010OpenAlexW2099791375MaRDI QIDQ3351369

G. W. Richards, Frank K. Hwang

Publication date: 1991

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/26.87219

zbMATH Keywords

bipartite graphcapacityswitching networksperfect matchingcombinatorial designspartial concentrator

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

The capacity of the subarray partial concentrators

This page was built for publication: Using combinatorial designs to construct partial concentrators