Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
From MaRDI portal
Publication:3689205
DOI10.1137/0606057zbMATH Open0572.05027OpenAlexW2092946387MaRDI QIDQ3689205FDOQ3689205
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
Recommendations
Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Explicit constructions of linear-sized superconcentrators
- A New Lower Bound for the Number of Switches in Rearrangeable Networks
- Title not available (Why is that?)
- On rearrangeable and non-blocking switching networks
- Parallel permutation and sorting algorithms and a new generalized connection network
- Rearrangeable Networks with Limited Depth
- Asymptotically optimal switching circuits
- A fast parallel algorithm for routing in permutation networks
- Control Algorithms for Rearrangeable Clos Networks
- Generalized multi‐stage connection networks
- Generalized Connectors
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)
