Analyzing Nonblocking Multilog Networks With the König–egevarý Theorem

Discrete Mathematics, Algorithms and Applications - Singapore
doi 10.1142/s1793830909000117
Full Text
Abstract

Available in full text

Date
Authors
Publisher

World Scientific Pub Co Pte Lt

Related search

On a Theorem of W. Meyer-König and H. Tietz

International Journal of Mathematics and Mathematical Sciences
Mathematics
2005English

Strictly Nonblocking Three-Stage Clos Networks With Some Rearrangeable Multicast Capability

IEEE Transactions on Communications
Electronic EngineeringElectrical
2003English

Blocking and Nonblocking Multirate Clos Switching Networks

IEEE/ACM Transactions on Networking
Electronic EngineeringComputer NetworksCommunicationsComputer Science ApplicationsElectricalSoftware
1998English

Improved Bounds on Nonblocking 3-Stage Clos Networks

SIAM Journal on Computing
MathematicsComputer Science
2007English

Parallel Routing Algorithms for Nonblocking Electronic and Photonic Switching Networks

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
2005English

Analysis of a Recurrence Arising From a Construction for Nonblocking Networks

SIAM Journal on Discrete Mathematics
Mathematics
1995English

Generalised Nonblocking

2008English

Are Nonblocking Networks Really Needed for High-End-Computing Workloads?

2008English

Sophokles, König Ödipus

2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy