Asymptotically optimal switching circuits
From MaRDI portal
Publication:1165218
zbMath0486.94021MaRDI QIDQ1165218
Publication date: 1981
Published in: Problems of Information Transmission (Search for Journal in Brave)
superconcentrators; concentrators; connections of graph inputs and outputs; non-unary concentrators; nonblocking circuits
94C15: Applications of graph theory to circuits and networks
Related Items
Sparse and limited wavelength conversion in all-optical tree networks, Highly symmetric expanders, The Steiner tree problem on graphs: inapproximability results, Expanders obtained from affine transformations, Eigenvalues and expanders, Decoding concatenated codes with inner convolutional codes, On the relationship between the diameter and the size of a boundary of a directed graph, A lower bound for tree resolution, Multi-processor scheduling and expanders, Natural bounded concentrators, Bipartite multigraphs with expander-like properties, Some Graph-Colouring Theorems with Applications to Generalized Connection Networks, Expanders and Diffusers, Diameters and Eigenvalues