A New Technique for Finding Min-cut Tree

Ashwani Kumar, Surinder Pal Singh, Nitin Arora
2013 International Journal of Computer Applications  
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 2 .logV + V 2 .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 sorts of graphs but for the dense graphs success rate is more than 90%. Moreover in
more » ... unsuccessful cases, the deviation from actual result is very less (usually for less than 5% pairs) and for most of the pairs we obtain correct values of max-flow or min-cut.
doi:10.5120/12084-9170 fatcat:5q4t3kwukzgqdkelu47t7klzwi