Minimum flows in directed s-t planar networks

作者：Georgescu Oana^*; Ciurea Eleonor

来源：Bulletin Mathematique de la Societe des Sciences Mathematiques de Roumanie, 2010, 53(4): 305-313.

• Network flow
• network algorithms
• minimum flow problem
• planar graphs

We present an algorithm for finding maximum cut and an algorithm for minimum flow in directed s-t planar networks. Finally, we present an example for these two algorithms.

• 出版日期2010