Higher dimensional hexagonal networks

DOI10.1016/J.JPDC.2003.07.001zbMath1121.68320OpenAlexW2027268578MaRDI QIDQ1877642

Ivan Stojmenović, Julio Solano, Fabián García, Milos Stojmenović

Publication date: 19 August 2004

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2003.07.001

zbMATH Keywords

RoutingInterconnection networksAddressingHexagonal networks

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (5)

The number of shortest paths in the (n, k)-star graph ⋮ The number of shortest paths in the arrangement graph ⋮ On minimum metric dimension of honeycomb networks ⋮ Distance formula and shortest paths for the \((n,k)\)-star graphs ⋮ A family of efficient six-regular circulants representable as a Kronecker product

This page was built for publication: Higher dimensional hexagonal networks