WDM Switching Networks, Rearrangeable and Nonblocking [w,f]-connectors
From MaRDI portal
Publication:5470713
DOI10.1137/S0097539704442714zbMath1089.05062OpenAlexW1992204509MaRDI QIDQ5470713
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539704442714
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Structural characterization of families of graphs (05C75)
Related Items (1)
This page was built for publication: WDM Switching Networks, Rearrangeable and Nonblocking [w,f]-connectors