Dynamic routing schemes for graphs with low local density

DOI10.1145/1383369.1383372zbMath1445.68169OpenAlexW2010216648MaRDI QIDQ4962746

Amos Korman, David Peleg

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

distributed algorithmsdynamic networksrouting schemes

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Density (toughness, etc.) (05C42)

This page was built for publication: Dynamic routing schemes for graphs with low local density