Rearrangeable nonblocking condition for multi-log\(_ 2 N\) multiconnection networks

DOI10.1016/0020-0190(93)90251-4zbMath0792.68002OpenAlexW1976666075MaRDI QIDQ1313749

Yanghee Choi, Kyoon Ha Lee, Yeonghwan Tscha

Publication date: 24 February 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90251-4

zbMATH Keywords

broadband networksedge-coloring algorithmsmulticonnection networkrearrangeable nonblocking

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) General theory of computer systems (68M01)

Cites Work

• Unnamed Item
• Unnamed Item
• On a Class of Multistage Interconnection Networks
• Using euler partitions to edge color bipartite multigraphs