scientific article; zbMATH DE number 1256693
From MaRDI portal
Publication:4228428
zbMath0977.68544MaRDI QIDQ4228428
Publication date: 16 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Related Items (11)
Direct routing: Algorithms and complexity ⋮ Safe and efficient traffic laws for mobile robots ⋮ Towards a better understanding of pure packet routing ⋮ Many-to-many routing on trees via matchings ⋮ Information gathering in ad-hoc radio networks with tree topology ⋮ Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus ⋮ Routing with bounded buffers and hot-potato routing in vertex-symmetric networks ⋮ Hot-potato routing on multi-dimensional tori ⋮ Greedy hot-potato routing on the two-dimensional mesh ⋮ Networks on which hot-potato routing does not livelock ⋮ On the theory of interconnection networks for parallel computers
This page was built for publication:
