Novel Approximation Algorithm for Calculating Maximum Flow in a Graph

Abstract

In this paper a new approximation algorithm for calculating the min-cut tree of an undirected edgeweighted graph has been proposed. This algorithm runs, where V is the number of vertices in the given graph and d is the degree of the graph. It is a significant improvement over time complexities of existing solutions. However, because of an assumption it does not produce correct result for all sort of graphs but for the dense graphs success rate is more than 90%. Moreover in the unsuccessful cases, the deviation from actual result is very less and for most of the pairs we obtain correct values of max-flow or mincut. This algorithm is implemented in JAVA language and checked for many input cases.

Optimization of Gas Transmission Pipeline using Ant Colony Optimization

“…Ford Fulkerson algorithm can also be used for calculating the maximum flow in the networks. Modified ford fulkerson algorithm is proposed in [7][8][9][10][11] Ant Colony Optimization technique is a newer evolutionary method and was inspired by the behavior of ants where they search for the shortest route between food and their home following a chemical called "Pheromone". The application of ant colony has been used for minimizing fuel cost in compressors.…”