Many-to-Many Routing on Trees via Matchings (1996)

by Grammati E. Pantziou , Alan Roberts , Antonis Symvonis
Citations:10 - 4 self

Documents Related by Co-Citation

36 Routing Permutations on Graphs via Matchings – Noga Alon, F. R. K. Chung, R. L. Graham - 1994
16 Optimal Bounds for Matching Routing on Trees – Louxin Zhang - 1997
63 Exact analysis of hot-potato routing – U Feige, P Raghavan - 1992
1305 Introduction to Parallel Algorithms and Architectures – F T Leighton - 1991
126 On distributed communications networks – P Baran - 1964
41 Hot-potato routing on processor arrays – C Kaklamanis, D Krizanc, S Rao
5 Routing permutations on graphs via matchings (extended abstract – N Alon, F R K Chung, R L Graham - 1993
10 Parallel Neighbor-Sort (or the Glory of the Induction Principle – N Haberman - 1972
5 Many-to-One Packet Routing via Matchings – Danny Krizanc, Louxin Zhang - 1997
5 Dynamic Tree Routing under the "Matching with Consumption" Model – Grammati E. Pantziou, Alan Roberts, Antonis Symvonis - 1996
31 Deterministic many-to-many hot potato routing – Allan Borodin, Yuval Rabani, Baruch Schieber - 1997
24 Greedy hot-potato routing on the two-dimensional mesh – I Ben-Aroya, T Eilam, A Schuster - 1995
35 Fast deflection routing for packets and worms – A Bar-Noy, P Raghavan, B Schieber, H Tamaki - 1993
11 Routing on Trees – Antonios Symvonis - 1994
30 Hot-potato algorithms for permutation routing – I Newman, A Schuster - 1995
30 Bounds on Maximum Delay in Networks with Deflection Routing – J T Brassil, R L Cruz - 1995
22 Dynamic deflection routing on arrays – A Broder, E Upfal - 1996
11 Õ(Congestion + Dilation) hot-potato routing on leveled networks – Costas Busch - 2002
16 Packet routing and job-scheduling in O(congestion + dilation) steps, Combinatorica 14 – F T Leighton, B M Maggs, S B Rao - 1994