Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search Scott Beamer EECS Department University of California Berkeley, California

First Page		Document Content
Date: 2013-03-15 00:51:18 Graph theory Graph connectivity Search algorithms Breadth-first search Graph traversal Spanning tree Strongly connected component Tree Ear decomposition Connected component Graph coloring Maximal independent set		Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search Scott Beamer EECS Department University of California Berkeley, California Add to Reading List Source URL: crd.lbl.gov Download Document from Source Website File Size: 356,96 KB Share Document on Facebook

	Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org ON DYNAMIC BREADTH-FIRST SEARCH IN EXTERNAL-MEMORY ULRICH MEYER 1 DocID: 1uYtC - View Document
	Information Processing Letters–229 www.elsevier.com/locate/ipl Salembier’s Min-tree algorithm turned into breadth first search Wim H. Hesselink Department of Mathematics and Computing Science, Rijksuniv DocID: 1uX4F - View Document
	Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search Scott Beamer EECS Department University of California Berkeley, California DocID: 1tfnh - View Document
	Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved DocID: 1rtvU - View Document
	6.006 Intro to Algorithms QUIZ 2 REVIEW NOTES - Part 2 April 12, 2011 DocID: 1rsoU - View Document