scientific article; zbMATH DE number 4201663

MaRDI QIDQ3350798zbMATH OpenFDO

Authors Jean-Claude Bermond, G. Illiades, Claudine Peyrat

Publication date 1989

zbMATH Keywords

diameter

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Computational and Information Science
• Minimal diameter double-loop networks. I. Large infinite optimal families
• Optimal double-loop networks with non-unit steps
• scientific article; zbMATH DE number 1908099
• An efficient algorithm to find optimal double loop networks

Cited in

(16)

• Hamiltonian decomposition of Cayley graphs of degree 4
• Large fault-tolerant interconnection networks
• Broadcasting in the butterfly network
• Distributed loop network with minimum transmission delay
• Multiplicative circulant networks. Topological properties and communication algorithms
• Fault-tolerant routings in double fixed-step networks
• A survey on multi-loop networks.
• On congruence in \(\mathbb{Z}^ n\) and the dimension of a multidimensional circulant
• Graded Betti numbers of some families of circulant graphs
• Minimum chromaticity of circulant graphs
• Network properties of double and triple fixed step graphs
• Searching for large multi-loop networks
• Computing the Diameter in Multiple-Loop Networks
• scientific article; zbMATH DE number 7310081 (Why is no real title available?)
• Discovery of infinite families of optimal double-loop networks with a given template of generators
• Dense Gaussian networks: Suitable topologies for on-chip multiprocessors

This page was built for publication:

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