Some Graph-Colouring Theorems with Applications to Generalized Connection Networks

DOI10.1137/0606057MaRDI QIDQ3689205zbMATH OpenOpenAlexFDO

Authors David Kirkpatrick, Maria M. Klawe, Nicholas 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)

Recommendations

• Sparse Asymmetric Connectors in Communication Networks
• Construction of asymmetric connectors of depth two
• Wide-Sense Nonblocking Networks
• Controllable connector
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

Cites work

• scientific article; zbMATH DE number 3225079 (Why is no real title available?)
• scientific article; zbMATH DE number 3329939 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• A New Lower Bound for the Number of Switches in Rearrangeable Networks
• A fast parallel algorithm for routing in permutation networks
• Asymptotically optimal switching circuits
• Control Algorithms for Rearrangeable Clos Networks
• Explicit constructions of linear-sized superconcentrators
• Generalized Connectors
• Generalized multi‐stage connection networks
• On rearrangeable and non-blocking switching networks
• Parallel permutation and sorting algorithms and a new generalized connection network
• Rearrangeable Networks with Limited Depth

Cited in

(6)

• Constructions of sparse asymmetric connectors with number theoretic methods
• Sparse Asymmetric Connectors in Communication Networks
• On 3-stage Clos networks with different nonblocking requirements on two types of calls
• Construction of asymmetric connectors of depth two
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Controllable connector

This page was built for publication: Some Graph-Colouring Theorems with Applications to Generalized Connection Networks

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