Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved

First Page		Document Content
Date: 2015-11-20 13:17:47 Graph theory Mathematics Search algorithms Graph traversal Breadth-first search Vertex NP-complete problems Graph coloring Planar graphs Depth-first search		Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved Add to Reading List Source URL: mug.mvapich.cse.ohio-state.edu Download Document from Source Website File Size: 886,83 KB Share Document on Facebook

	The Square Root Phenomenon in Planar Graphs Survey and New Results Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) DocID: 1v4B2 - View Document
	Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org DETERMINISTICALLY ISOLATING A PERFECT MATCHING IN BIPARTITE PLANAR GRAPHS SAMIR DATTA 1 , RAGHAV KULKARNI 2 , AND SAMBU DocID: 1uYYo - View Document
	Subexponential parameterized algorithms on planar graphs via low-treewidth pattern covering Dániel Marx (joint work with Fedor Fomin, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh) DocID: 1uVYI - View Document
	The Square Root Phenomenon in Planar Graphs Survey and New Results Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) DocID: 1uSoc - View Document
	Stars and bunches in planar graphs. Part II : General planar graphs and colourings ∗ O. V. Borodin,1 H. J. Broersma,2 DocID: 1uzoK - View Document