Generalized Connectors

DOI10.1137/0207040MaRDI QIDQ4165407zbMATH OpenOpenAlexFDO

Authors Nicholas 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

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

Cited in

(5)

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

This page was built for publication: Generalized Connectors

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