For example, if you wanted to route traffic on the Internet, study all the connections on Facebook, or analyze genomic data, you could easily end up with graphs with millions, billions or even trillions of edges.” The CSAIL researchers developed a new theoretical algorithm that has the potential to dramatically reduce the number of operations needed to solve the max-flow problem.