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 ...

The paper considers a project scheduling problem in weighted directed graphs in which arcs represent operations while nodes are identified with starting and finishing endpoints of the operations; arc ...