4 citations · 5 across the 7 of their papers we have counts for
1 paper · 2 filters
Indranil Banerjee, Dana Richards
In this paper we present some new complexity results on the routing time of a graph under the \textit{routing via matching} model. This is a parallel routing model which was introd…