Before revision:  As we process the vertices in a topological order, these at most 2^k frontier antichains can be maintained with the help of several combinatorial properties . As such, it is enough to sweep the graph once from left to right, paying only f(k) along the way , which is a new surprising insight into the classical MPC problem .
After revision:  As we process the vertices in a topological order, these at most 2^k frontier antichains can be maintained with the help of several combinatorial properties , paying only f(k) along the way , which is a new surprising insight into the classical MPC problem .