Greedy Dynamic Routing on Arrays

DOI10.1006/JAGM.1998.0958MaRDI QIDQ4225869zbMATH OpenOpenAlexFDO

Authors Nabil Kahalé, Tom Leighton

Publication date 17 January 1999

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1998.0958

zbMATH Keywords

dynamic routing

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Publication:4886091
• Bounds on the greedy routing algorithm for array networks
• Greedy routing in circulant networks
• On k-greedy routing algorithms
• scientific article; zbMATH DE number 1256752
• Algorithms – ESA 2005
• scientific article; zbMATH DE number 1445335
• Greedy hot-potato routing on the two-dimensional mesh
• Dynamic Routing Schemes for General Graphs
• Schnyder greedy routing algorithm

Cited in

(5)

• Average-case analysis of greedy packet scheduling
• scientific article; zbMATH DE number 1256752 (Why is no real title available?)
• scientific article; zbMATH DE number 910914 (Why is no real title available?)
• Average-case analysis of greedy packet scheduling (extended abstract)
• Bounds on the greedy routing algorithm for array networks

This page was built for publication: Greedy Dynamic Routing on Arrays

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