Incremental maximum flow computation on evolving networks
Sergio Greco, Cristian Molinaro, Chiara Pulice, Ximena Quintana · 2017
The maximum flow problem is a classical optimization problem with a wide range of applications. Nowadays, it is successfully applied in social network analysis for link spam detection, web communities identification, and others. In such applications, flow networks are used to model connections among web pages, online voting systems, web communities, P2P and other distributed systems. Thus, networks are highly dynamic, that is, subject to frequent updates.