An Augmenting-Path-Based Symbolic ADD Algorithm for Maximum Flow in Networks
网络最大流问题求解的符号ADD增广路径算法

In this paper, the augmenting-path-based symbolic ADD (Algebraic Decision Diagram) algorithm for maxi- mum flow in networks is proposed. In the algorithm, the network and the maximum flow problem are formulated via ADD (Algebraic Decision Diagram), and Hachtels' symbolic algorithm for maximum flow in unit capacity networks is integrated with Gabow's scaling algorithm to transfer the general problem into a sequence of maximum flow problem in unit capacity network. The simulation results show that the novel symbolic algorithm can improve the space complexi- ty, compared with Dinic's algorithm and Karzanov's algorithm, and can be used to handle larger-scale general network flow problems.