Obtained Results in the Maximal Flow Problem
In the end of the eighties I begin to work with Rui Salgueiro on an
incremental chain maximal flow algorithm trying to develope a competitive
code. At the moment the developed codes seems to be (at least) competitive
with other codes for incremental chains algorithms (such as Dinic's algorithm).
I am already trying to improve the data structures we used and,
as a consequence, no paper is being to appear in a very near future.
Someone interested in the developed codes can give a look in the
appearing in my page.
Graphic Results of Comparative Computational Experiments.
(GIF Pictures )
10000 NODES --- DENSITIES: 2 /
21000 NODES --- DENSITIES: 2 /
(Click here to see the LEGENDS
of the pictures)
Last Update: May 23th, 1995