Constant time per edge is optimal on rooted tree networks
From MaRDI portal
Publication:5137341
DOI10.1007/s004460050036zbMath1448.68182MaRDI QIDQ5137341
Publication date: 2 December 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.7344
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems