Date: 2015-11-20 13:17:45Mathematics Graph theory Discrete mathematics Search algorithms Graph traversal Breadth-first search Vertex Connectivity Shortest path problem Graph coloring Planar separator theorem | | Parallel Breadth First Search on GPU Clusters using MPI and GPUDirect Speaker: Harish Kumar Dasari, Scientific Computing and Imaging Institute, University of Utah Advisor: Dr. Martin Berzins, SCI, University of UtahAdd to Reading ListSource URL: mug.mvapich.cse.ohio-state.eduDownload Document from Source Website File Size: 650,69 KBShare Document on Facebook
|