A New Bound for Pure Greedy Hot Potato Routing

DOI10.1007/978-3-540-70918-3_5zbMath1186.68024OpenAlexW1598798357MaRDI QIDQ3590922

Manfred Kunde

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (1)

Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus

This page was built for publication: A New Bound for Pure Greedy Hot Potato Routing