On the total\(_k\)-diameter of connection networks
type: Item
instance of: scholarly article
title: On the total\(_k\)-diameter of connection networks
zbMATH Open document ID: 0949.68008
DOI: 10.1016/S0304-3975(98)00348-X
published in: Theoretical Computer Science
publication date: 2000-10-26T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1521731
zbMATH Keywords: communication network
zbMATH Keywords: connection network
zbMATH Keywords: edge-disjoint paths
zbMATH Keywords: total-distance
zbMATH Keywords: total-diameter
zbMATH Keywords: flow in networks
author: Tamar Eilam
author: Shlomo Moran
author: Shmuel Zaks
author: Yefim Dinitz
MaRDI profile type: Publication
cites work: Q3619797
cites work: Q3292914
cites work: On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
cites work: Hop-Congestion Trade-Offs for High-Speed Networks
cites work: 2-diameter of de Bruijn graphs
cites work: Q4028113
cites work: Message complexity versus space complexity in fault tolerant broadcast protocols
cites work: Efficient dispersal of information for security, load balancing, and fault tolerance
full work available at URL: s0304-3975(98)00348-x
OpenAlex ID: W2001836556
description: scientific article; zbMATH DE number 1521731