Generalized Connectors

DOI10.1137/0207040zbMath0385.05036OpenAlexW4240994977MaRDI QIDQ4165407

Nicholas J. Pippenger

Publication date: 1978

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3452d47c674401572525e053d265ccabb4128124

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Explicit Concentrators from Generalized N-Gons ⋮ Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors ⋮ Size bounds for superconcentrators ⋮ Construction of expanders and superconcentrators using Kolmogorov complexity ⋮ Some Graph-Colouring Theorems with Applications to Generalized Connection Networks

This page was built for publication: Generalized Connectors