A rearrangement algorithm for switching networks composed of digital symmetrical matrices

DOI10.1016/S0020-0255(00)00007-4zbMath0965.94031MaRDI QIDQ1573379

N. Delaunay

Publication date: 5 August 2001

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

upper bounddigital symmetrical matricesDSM networksrearrangeability of switching networks

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• On Nonblocking Multiconnection Networks
• Three-Stage Multiconnection Networks Which Are Nonblocking in the Wide Sense
• On Nonblocking Switching Networks Composed of Digital Symmetrical Matrices
• On nonblocking multiconnection networks composed of digital switching matrices
• Control Algorithms for Rearrangeable Clos Networks
• Rearrangeability of multi‐connection three‐stage clos networks

This page was built for publication: A rearrangement algorithm for switching networks composed of digital symmetrical matrices