A new algorithm efficiently solves the graph isomorphism problem, which has puzzled computer scientists for decades.

We propose a linear-time, single-pass, top-down algorithm for multiple testing on directed acyclic graphs, where nodes represent hypotheses and edges specify a partial ordering in which the hypotheses ...