Novel Approximation Algorithm for Calculating Maximum Flow in a Graph
نویسندگان
چکیده
In this paper a new approximation algorithm for calculating the min-cut tree of an undirected edgeweighted graph has been proposed. This algorithm runs in 2 2 ( .log . ) O V V V d , 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.
منابع مشابه
A Novel Successive Approximation Method for Solving a Class of Optimal Control Problems
This paper presents a successive approximation method (SAM) for solving a large class of optimal control problems. The proposed analytical-approximate method, successively solves the Two-Point Boundary Value Problem (TPBVP), obtained from the Pontryagin's Maximum Principle (PMP). The convergence of this method is proved and a control design algorithm with low computational complexity is present...
متن کاملA New Technique for Finding Min-cut Tree
In this paper we propose a new approximation algorithm for calculating the min-cut tree of an undirected edge-weighted graph. Our algorithm runs in O(V.logV + V.d), 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 resul...
متن کاملON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...
متن کاملn)-Approximation Algorithm For Directed Sparsest Cut
We give an O( √ n)-approximation algorithm for the Sparsest Cut Problem on directed graphs. A näıve reduction from Sparsest Cut to Minimum Multicut would only give an approximation ratio of O( √ n log D), where D is the sum of the demands. We obtain the improvement using a novel LP-rounding method for fractional Sparsest Cut, the dual of Maximum Concurrent Flow.
متن کاملFast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques
Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques by Lorenzo Orecchia Doctor of Philosophy in Computer Science University of California, Berkeley Professor Satish Rao, Chair Graph-partitioning problems are a central topic of research in the study of approximation algorithms. They are of interest to both theoreticians, for their far-reach...
متن کامل