Maximum Capacity-based Minimum Cut Algorithm

Implementing an E cient Minimum Capacity Cut Algorithm 1

In this paper, we present an e cient implementation of the O(mn + n 2 logn) time algorithm originally proposed by Nagamochi and Ibaraki (1992) for computing the minimum capacity cut of an undirected network. To enhance computation, various ideas are added so that it can contract as many edges as possible in each iteration. To evaluate the performance of the resulting implementation, we conducte...

Unifying Maximum Cut and Minimum Cut of a Planar Graph

Absfmcf-We consider the real-weight maximum cut of a planar graph. Given an undirected planar graph with real-valued weights associated with its edges, find a partition of the vertices into two nonemply sets such that the sum of the weights of the edges connecting the two sets is maximum. The conventional maximum cut and minimum cut problems assume nonnegative edge weights, and thus are special...

Lecture 17 : Maximum Flow and Minimum Cut

Last lecture we studied duality of linear programs (LP), specifically how to construct the dual, the relation between the optimum of an LP and its dual, and some duality applications. In this lecture, we will talk about another application of duality to prove one of the theorems in combinatorics so called Maximum Flow-Minimum Cut Problem. The theorem roughly says that in any graph, the value of...

Approximation Algorithm for Maximum Cut

Fast Incremental Minimum-Cut Based Algorithm for Graph Clustering

In this paper we introduce an incremental clustering algorithm for undirected graphs. The algorithm can maintain clusters efficiently in presence of insertion and deletion (updation) of edges and vertices. The algorithm produces clusters that satisfies the quality requirement, given by the bicriteria of [6]. To the best of our knowledge, this is the first clustering algorithm, for dynamic graph...