Well, if I remember my graph theory well enough, if A is the adjacency matrix of the graph, each entry of A^n is the number of ways to get between the corresponding nodes in n steps or less. So, to do ...

This is a preview. Log in through your library . Abstract We propose a linear-time, single-pass, top-down algorithm for multiple testing on directed acyclic graphs, where nodes represent hypotheses ...