Optimal distance networks of low degree for parallel computers

DOI10.1109/12.93744zbMath1395.68024OpenAlexW2127169135MaRDI QIDQ5375417

Enrique Herrada, Agustin Arruabarrena, José L. Balcázar, Ramón Beivide

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/108974

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (13)

Dense bipartite circulants and their routing via rectangular twisted torus ⋮ Algorithmic and explicit determination of the Lovász number for certain circulant graphs ⋮ Multiplicative circulant networks. Topological properties and communication algorithms ⋮ Embedding Circulant Networks into Butterfly and Benes Networks ⋮ Tight-optimal circulants vis-à-vis twisted tori ⋮ On the partition dimension of a class of circulant graphs ⋮ Cycle Kronecker products that are representable as optimal circulants ⋮ Bothway embedding of circulant network into grid ⋮ A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS ⋮ Optimal routing in double loop networks ⋮ Unnamed Item ⋮ Clique, chromatic, and Lovász numbers of certain circulant graphs ⋮ Identifying codes of degree 4 Cayley graphs over abelian groups

This page was built for publication: Optimal distance networks of low degree for parallel computers