scientific article; zbMATH DE number 1256693
From MaRDI portal
Publication:4228428
Recommendations
Cited in
(25)- Potential function analysis of greedy hot-potato routing
- Many-to-many routing on trees via matchings
- A lower bound for nearly minimal adaptive and hot potato algorithms
- Information gathering in ad-hoc radio networks with tree topology
- Direct routing: Algorithms and complexity
- Randomized Single-Target Hot-Potato Routing
- Hard-potato routing
- Deflection routing on a torus is monotone
- Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus
- A New Bound for Pure Greedy Hot Potato Routing
- Scheduled Hot-Potato Routing
- scientific article; zbMATH DE number 1555950 (Why is no real title available?)
- A lower bound for nearly minimal adaptive and hot potato algorithms
- On the theory of interconnection networks for parallel computers
- scientific article; zbMATH DE number 1875375 (Why is no real title available?)
- scientific article; zbMATH DE number 1445335 (Why is no real title available?)
- Safe and efficient traffic laws for mobile robots
- Towards a better understanding of pure packet routing
- Greedy hot-potato routing on the two-dimensional mesh
- Networks on which hot-potato routing does not livelock
- Euro-Par 2004 Parallel Processing
- Routing with bounded buffers and hot-potato routing in vertex-symmetric networks
- Hot-potato routing on multi-dimensional tori
- Dynamic tree routing under the “matching with consumption” model
- \(\widetilde{O}\) (congestion + dilation) hot-potato routing on leveled networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228428)
