Distributed Multi-Destination Routing: The Constraints of Local Information
From MaRDI portal
Publication:3694713
DOI10.1137/0214062zbMath0575.68070OpenAlexW2055891819MaRDI QIDQ3694713
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0214062
Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Related Items (4)
Distributed multicast routing in point-to-point networks ⋮ Low-light trees, and tight lower bounds for Euclidean spanners ⋮ A note on distributed multicast routing in point-to-point networks ⋮ Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones
This page was built for publication: Distributed Multi-Destination Routing: The Constraints of Local Information
