Scheduled Hot-Potato Routing

DOI10.7155/JGAA.00007MaRDI QIDQ4397215zbMATH OpenOpenAlexFDO

Authors Joseph (Seffi) Naor, Raphael Rom, Ariel Orda

Publication date 5 July 1998

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/47961

zbMATH Keywords

directed tree-networkshot-potato routing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1256693
• Euro-Par 2004 Parallel Processing
• Hard-potato routing
• Baked-Potato Routing

Cited in

(5)

• Costly circuits, submodular schedules and approximate Carathéodory theorems
• Baked-Potato Routing
• Networks on which hot-potato routing does not livelock
• Euro-Par 2004 Parallel Processing
• \(\widetilde{O}\) (congestion + dilation) hot-potato routing on leveled networks

This page was built for publication: Scheduled Hot-Potato Routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4397215)