On the total\(_k\)-diameter of connection networks

DOI10.1016/S0304-3975(98)00348-XzbMath0949.68008OpenAlexW2001836556MaRDI QIDQ1583253

Tamar Eilam, Shmuel Zaks, Shlomo Moran

Publication date: 26 October 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00348-x

zbMATH Keywords

communication networkedge-disjoint pathsconnection networkflow in networkstotal-diametertotal-distance

Mathematics Subject Classification ID

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

Related Items (1)

Exact communication costs for consensus and leader in a tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Hop-Congestion Trade-Offs for High-Speed Networks
• Message complexity versus space complexity in fault tolerant broadcast protocols
• 2-diameter of de Bruijn graphs

This page was built for publication: On the total\(_k\)-diameter of connection networks