Computer Science ›› 2005, Vol. 32 ›› Issue (10): 38-40.

Previous Articles     Next Articles

XU Zhou-Bo ,GU Tian-Long ,ZHAO Ling-Zhong(School of Computer Science, Guilin University of Electronic Technology, Guilin 541004)   

  • Online:2018-11-17 Published:2018-11-17

Abstract: In this paper, the augmenting-path-based symbolic ADD (Algebraic Decision Diagram) algorithm for maximum flow in networks is proposed. In the algorithm, the network and the maximum flow problem are formulated via ADD (Algebraic Decision Diagram), and Hach

Key words: Symbolic algorithms, Maximum flow, Algebraic decision diagram (ADD), Residual network

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!