ANALYZING NONBLOCKING MULTILOG NETWORKS WITH THE KÖNIG–EGEVARÝ THEOREM

DOI10.1142/S1793830909000117zbMath1229.68059OpenAlexW2005630429MaRDI QIDQ3634210

Duc Ha, Thanh-Nhan Nguyen, Hung Quang Ngo

Publication date: 23 June 2009

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830909000117

zbMATH Keywords

multicastphotonic switchingcross-talk freeKönig-Egevarý theoremwidesense nonblocking

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Log/sub 2/ (N, m, p) strictly nonblocking networks
• WDM Switching Networks, Rearrangeable and Nonblocking [w,f-connectors]

This page was built for publication: ANALYZING NONBLOCKING MULTILOG NETWORKS WITH THE KÖNIG–EGEVARÝ THEOREM