Results 1 
4 of
4
A New Technique for Finding MinCut Tree
 International Journal of Computer Applications (IJCA
, 2013
"... In this paper we propose a new approximation algorithm for calculating the mincut tree of an undirected edgeweighted 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 co ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
In this paper we propose a new approximation algorithm for calculating the mincut tree of an undirected edgeweighted 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 the 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 maxflow or mincut. Keywords Undirected edgeweighted graph; mincut tree; dense graphs; maxflow; mincut 1.
Novel Approximation Algorithm for Calculating Maximum Flow in a Graph
"... In this paper a new approximation algorithm for calculating the mincut tree of an undirected edgeweighted graph has been proposed. This algorithm runs in O V V V d ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper a new approximation algorithm for calculating the mincut tree of an undirected edgeweighted graph has been proposed. This algorithm runs in O V V V d
An Efficient Algorithm for Calculating Maximum Bipartite matching in a
"... In this paper we proposed a new approximation algorithm for calculating the mincut tree of an undirected edgeweighted 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 ..."
Abstract
 Add to MetaCart
In this paper we proposed a new approximation algorithm for calculating the mincut tree of an undirected edgeweighted 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. We implemented our algorithm in objected oriented programming language and checked for many input cases. 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 the unsuccessful cases, the deviation from actual result is very less and for most of the pairs we obtain correct values of maxflow.
Performance enhancement: for calculating the . . .
, 2013
"... In this paper a new approximation algorithm for calculating the mincut tree of an undirected edgeweighted graph has been proposed. This algorithm runs in O(V2.logV + V2.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 ti ..."
Abstract
 Add to MetaCart
In this paper a new approximation algorithm for calculating the mincut tree of an undirected edgeweighted graph has been proposed. This algorithm runs in O(V2.logV + V2.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 the sorts of graphs but for the dense graphs success rate is more than 90%. Moreover in the unsuccessful cases, the deviations from actual result is very less and for most of the pairs correct values of maxflow or mincut have been obtained. This algorithm is implemented in JAVA language and checked for many input cases.