Abstract: Breadth-First Search(BFS) is one of the most fundamental graph algorithms used as a component of many graph algorithms. Our new method for distributed parallel BFS can compute BFS for one ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results