Some Graph-Colouring Theorems with Applications to Generalized Connection Networks

DOI10.1137/0606057zbMath0572.05027OpenAlexW2092946387MaRDI QIDQ3689205

David G. Kirkpatrick, Maria M. Klawe, Nicholas J. Pippenger

Publication date: 1985

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://scholarship.claremont.edu/hmc_fac_pub/136

zbMATH Keywords

\(n\)-connector\(n\)-network

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15)

Related Items

Construction of asymmetric connectors of depth two, On 3-stage Clos networks with different nonblocking requirements on two types of calls

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotically optimal switching circuits
• Explicit constructions of linear-sized superconcentrators
• On rearrangeable and non-blocking switching networks
• A fast parallel algorithm for routing in permutation networks
• Parallel permutation and sorting algorithms and a new generalized connection network
• Rearrangeable Networks with Limited Depth
• A New Lower Bound for the Number of Switches in Rearrangeable Networks
• Generalized Connectors
• Control Algorithms for Rearrangeable Clos Networks
• Generalized multi‐stage connection networks