Blog

Fix an unweighted, weakly connected digraph $ \Gamma$ , possibly with loops, and of bounded degree. Call $ p$ a common $ n$ -ancestor of $ q_0,q_1$ if there are $ n$ -paths (directed paths of length exactly $ n$ ) from $ p$ to each $ q_i$ , and a last common ancestor ifRead more