A benchmarking algorithm to determine minimum aggregation delay for data gathering trees and an analysis of the diameter-aggregation delay tradeoff
From MaRDI portal
Publication:1736674
DOI10.3390/a8030435zbMath1461.94018OpenAlexW1511260442MaRDI QIDQ1736674
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a8030435
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
This page was built for publication: A benchmarking algorithm to determine minimum aggregation delay for data gathering trees and an analysis of the diameter-aggregation delay tradeoff