"No matter what graph we start with, after randomly flipping some edges or connections between the nodes, we show that ...

“I was actually inclined to believe … algorithms this good for this problem would not exist.” Maximum flow has been studied since the 1950s, when it was formulated to study the Soviet railway system. ...