![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 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](https://www.pdfsearch.io/img/6f1b46ba4d69102a9f0a88e71ee30e3d.jpg) Date: 2013-03-15 00:51:18Graph 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, CaliforniaAdd to Reading ListSource URL: crd.lbl.govDownload Document from Source Website File Size: 356,96 KBShare Document on Facebook
|