Fast Breadth-First Search in Still Less Space
share
It is shown that a breadth-first search in a directed or undirected graph with n vertices and m edges can be carried out in O(n+m) time with n_2 3+O(( n)^2) bits of working memory.
READ FULL TEXTIt is shown that a breadth-first search in a directed or undirected graph with n vertices and m edges can be carried out in O(n+m) time with n_2 3+O(( n)^2) bits of working memory.
READ FULL TEXT
