On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels
From MaRDI portal
Publication:4034446
DOI10.1109/18.179355zbMath0825.94164OpenAlexW2086670230MaRDI QIDQ4034446
Yitzhak Birk, Roy Meshulam, Nathan Linial
Publication date: 16 May 1993
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.179355
Related Items (7)
Nearly complete graphs decomposable into large induced matchings and their applications ⋮ Broadcast Transmission to Prioritizing Receivers ⋮ Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs ⋮ Colorings with only rainbow arithmetic progressions ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Unnamed Item ⋮ Multitasking Capacity: Hardness Results and Improved Constructions
This page was built for publication: On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels