2 citations · 3 across the 8 of their papers we have counts for
1 paper · 1 filter
Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh +1
Let G be a directed graph with n vertices and m edges, and let s∈V(G) be a designated source vertex. We consider the problem of single source reachability (SSR) from $s…