Abstract: We give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback