> The current theoretically best max flow algorithm uses, at its core, an SDD solver. Does anyone know how this improvement in solving SDD affects the complexi

> The current theoretically best max flow algorithm uses, at its core, an SDD solver. Does anyone know how this improvement in solving SDD affects the complexity of the current best max-flow algorithm [1] i.e. (N+L)^(4/3) ? [1]: http://web.mit.edu/newsoffice/2010/max-flow-speedup-0927.html http://web.mit.edu/newsoffice/2010/max-flow-speedup-0927.htm...