4 citations · 5 across the 7 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.DS2016
Sorting Networks On Restricted Topologies
Indranil Banerjee, Dana Richards, Igor Shinkar
The sorting number of a graph with vertices is the minimum depth of a sorting network with inputs and outputs that uses only the edges of the graph to perform comparisons.…
cs.DM2016
Routing Number Of A Pyramid
Indranil Banerjee, Dana Richards
In this short note we give the routing number of pyramid graph under the \textit{routing via matching} model introduced by Alon et al\cite{5}. This model can be viewed as a communi…
cs.DM2016★ 4 cited
Routing and Sorting Via Matchings On Graphs
Indranil Banerjee, Dana Richards
The paper is divided in to two parts. In the first part we present some new results for the \textit{routing via matching} model introduced by Alon et al\cite{5}. This model can be…