Back to Results
First PageMeta Content
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

Document Date: 2013-03-15 00:51:18


Open Document

File Size: 356,96 KB

Share Result on Facebook