Complexity analysis of broadcasting in hypercubes with restricted communication capabilities
From MaRDI portal
Publication:1200159
DOI10.1016/0743-7315(92)90040-TzbMath0763.68039MaRDI QIDQ1200159
Publication date: 17 January 1993
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)
Related Items (5)
Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks ⋮ Methods and problems of communication in usual networks ⋮ Oriented hypercubes ⋮ Optimal communication algorithms for Manhattan Street networks ⋮ Broadcasting in DMA-bound bounded degree graphs
This page was built for publication: Complexity analysis of broadcasting in hypercubes with restricted communication capabilities
