Ultrafast Graph Algorithms on Reconfigurable Meshes


We present a selection of related algorithms which run in Θ(log(n)) expected time for random graphs on the modestly reconfigurable architecture known as the Mesh with Row and Column Subbuses (RCS-Mesh). Notably, this base model has been implemented as part of the communication architecture of the MasPar MP series [17]; in addition, algorithms for RCS-Mesh… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics