1 citations · 1 across the 5 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
A Gossiping Protocol for Sparse Ad-Hoc Radio Networks
Chao Wu, Marek Chrobak
We study the problem of gossiping (all-to-all information exchange) in ad-hoc radio networks. Such a network is represented by a strongly-connected directed graph with \(n\) vertic…
cs.DS2026
Two Complexity Results on Spanning-Tree Congestion Problems
Sunny Atalig, Marek Chrobak, Christoph Dürr +4
In the spanning-tree congestion problem (), we are given a graph , and the objective is to compute a spanning tree of that minimizes the maximum edge congestio…