The capacity of the subarray partial concentrators

DOI10.1016/0166-218X(92)90178-DMaRDI QIDQ1201810zbMATH OpenOpenAlexFDO

Authors 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 graphcapacityLatin squarespartial concentratorperfect matchingsubarray

Mathematics Subject Classification ID

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

Review text

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.

Recommendations

• Using combinatorial designs to construct partial concentrators
• Asymptotic results for partial concentrators
• On the Expected Capacity of Binomial and Random Concentrators
• Natural bounded concentrators
• scientific article; zbMATH DE number 4033793

Cites work

• Binomial Switching Networks for Concentration and Distribution
• scientific article; zbMATH DE number 3916184 (Why is no real title available?)
• Using combinatorial designs to construct partial concentrators
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property

Cited in

(4)

• An improved upper bound for the subarray partial concentrators
• The Expected Capacity of Concentrators
• scientific article; zbMATH DE number 4033793 (Why is no real title available?)
• Asymptotic results for partial concentrators

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201810)