Algorithms for minimum flows. Dinamic tree implementation

Authors

  • Oana Georgescu Transilvania University of Brasov, Romania

Keywords:

network flow, network algorithms, minimum flow problem, dynamic tree

Abstract

We present three algorithms for finding minimum flows in networks with arcs capacities using the dynamic tree implementation. Also, we present an example for one of these algorithms.

Author Biography

Oana Georgescu, Transilvania University of Brasov, Romania

Dept. of Theoretical Computer Science

Published

2008-11-30

Issue

Vol. 1(50) (2008)

Section

INFORMATICS