On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
From MaRDI portal
Publication:3205169
DOI10.1002/j.1538-7305.1979.tb02972.xzbMath0415.94021OpenAlexW2092198261MaRDI QIDQ3205169
Publication date: 1979
Published in: Bell System Technical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/j.1538-7305.1979.tb02972.x
communication networkssuperconcentratorsconcentratorsbounds for the number of edgesgeneralizersrearrangeable and nonblocking networks
Related Items
A lower bound for tree resolution, On using deterministic functions to reduce randomness in probabilistic algorithms, Smaller superconcentrators of density 28, Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles), Proof of Space from Stacked Expanders, Expanders obtained from affine transformations, Dense expanders and pseudo-random bipartite graphs, Eigenvalues and expanders, The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks, Expanders and Diffusers, Multilayer grid embeddings for VLSI, Explicit constructions of linear-sized superconcentrators, Size bounds for superconcentrators, Three-regular path pairable graphs, The Steiner tree problem on graphs: inapproximability results, Highly symmetric expanders, Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory, Improved sorting networks with O(log N) depth, Minimal selectors and fault tolerant networks, Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles), Pseudo-random hypergraphs, Diameters and Eigenvalues
