Concurrent threads and optimal parallel minimum spanning trees algorithm

DOI10.1145/375827.375847zbMath1089.68506OpenAlexW2155086352WikidataQ56077915 ScholiaQ56077915MaRDI QIDQ4406286

Eli Upfal, Andrei Z. Broder, Alan M. Frieze

Publication date: 25 June 2003

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/375827.375847

zbMATH Keywords

dynamic algorithmsstatic routingstability of dynamic packet routing algorithms

Mathematics Subject Classification ID

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

Related Items

Smallest bipartite bridge-connectivity augmentation, Packet latency of deterministic broadcasting in adversarial multiple access channels, An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs, The network as a storage device: dynamic routing with bounded buffers