13 citations · 41 across the 24 of their papers we have counts for
1 paper · 1 filter
Boris Brimkov
In this paper, we reduce the logspace shortest path problem to biconnected graphs; in particular, we present a logspace shortest path algorithm for general graphs which uses a logs…