A Simple Subquadratic Cut Query Protocol for Directed ReachabilityResearch Paper
A directed reachability question asks whether a sequence of directed edges leads from a specified source vertex to a specified target. Ordinary graph search answers it when outgoing neighbours can be inspected. A different question arises when the graph is hidden and an oracle reports only how many edges leave a chosen vertex set. This outgoing-cut oracle re…