Balanced Bidirectional Breadth-First Search on Scale-Free Networks

Sacha Cerf, Benjamin Dayan, Umberto De Ambroggio +3

To find a shortest path between two nodes $s_0$ and $s_1$ in a given graph, a classical approach is to start a Breadth-First Search (BFS) from $s_0$ and run it until the search dis…