Algorithm
For each level k, it finds the best way of computing level k from level k+1 reducing the problem to a weighted bipartite matching problem
……..
Sort edge
Sort edge
Pipeline edge
Pipeline edge
Previous slide
Next slide
Back to first slide
View graphic version