1 citations · 1 across the 3 of their papers we have counts for
1 paper · 2 filters
Damien Fay
In this paper we show how graph structure can be used to drastically reduce the computational bottleneck of the Breadth First Search algorithm (the foundation of many graph travers…