4 citations · 5 across the 7 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
New Results On Routing Via Matchings On Graphs
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…
cs.CG2017★ 1 cited
A Simple Convex Layers Algorithm
Raimi A. Rufai, Dana S. Richards
Given a set of points in the plane, the first layer of is formed by the points that appear on 's convex hull. In general, a point belongs to layer , if it…