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

DOI10.1142/S1793830909000117MaRDI QIDQ3634210zbMATH OpenOpenAlexFDO

Authors Thanh-Nhan Nguyen, Duc Ha, Hung Q. 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

cross-talk freeKönig-Egevarý theoremmulticastphotonic switchingwidesense nonblocking

Mathematics Subject Classification ID

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

Recommendations

• On Nonblocking Multiconnection Networks
• Rearrangeable nonblocking condition for multi-log\(_ 2 N\) multiconnection networks
• A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints
• scientific article; zbMATH DE number 2200743
• On nonblocking multiconnection networks composed of digital switching matrices

Cites work

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

Cited in

(3)

• A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints
• The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties
• A linear programming duality approach to analyzing strictly nonblocking \(d\)-ary multilog networks under general crosstalk constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3634210)