Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
- 1 October 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 6 (4) , 576-582
- https://doi.org/10.1137/0606057
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Control Algorithms for Rearrangeable Clos NetworksIEEE Transactions on Communications, 1983
- Rearrangeable Networks with Limited DepthSIAM Journal on Algebraic Discrete Methods, 1982
- Parallel permutation and sorting algorithms and a new generalized connection networkJournal of the ACM, 1982
- Explicit constructions of linear-sized superconcentratorsJournal of Computer and System Sciences, 1981
- A fast parallel algorithm for routing in permutation networksIEEE Transactions on Computers, 1981
- A New Lower Bound for the Number of Switches in Rearrangeable NetworksSIAM Journal on Algebraic Discrete Methods, 1980
- Generalized ConnectorsSIAM Journal on Computing, 1978
- On rearrangeable and non-blocking switching networksJournal of Computer and System Sciences, 1978
- Generalized multi‐stage connection networksNetworks, 1972