A possible optimal design of one-way Hamming network H(n,3) based on the minimum transmission latency

DOI10.1007/S10878-018-0329-ZMaRDI QIDQ2424657zbMATH OpenOpenAlexFDO

Authors Yanyan Wen, Guorong Chai, Qiuli Li, Zhe George Zhang

Publication date 25 June 2019

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-018-0329-z

zbMATH Keywords

Hamming networknetwork theoryoriented diametertransmission latency

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Minimal diameter double-loop networks: Dense optimal families
• Minimal diameter double-loop networks. I. Large infinite optimal families
• Triple loop networks with small transmission delay
• scientific article; zbMATH DE number 1785752
• On transmitting delay in a distance-transitive strongly antipodal graph

Cites work

• A survey of the theory of hypercube graphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Distances in orientations of graphs
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• scientific article; zbMATH DE number 3991541 (Why is no real title available?)
• Minimum orders of Eulerian oriented digraphs with given diameter
• Orientations of the n-cube with minimum diameter
• Robbins's Theorem for Mixed Multigraphs
• Strongly self-centered orientation of complete k-partite graphs
• TWO REALIZABILITY INTERPRETATIONS OF MONOTONE INDUCTIVE DEFINITIONS

This page was built for publication: A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2424657)