Stack Overflow
Stack Overflow

Questions tagged [minimum-cut]

A problem in computer science related to graph theory

The minimum cut (min-cut) problem is a etic problem in computer science, studied in the theory of s. It is closely related to the problem for flow networks.

The problem is: given a weighted graph, find the cut that crosses edges with the smallest possible total weight.

30 questions
1
vote
1 answer

independent times to ensure minimum cut of graph at least one trial succeeds

I just finished with the first module in the algo specialization course in coursera. There was an exam question that i could not quite understand. I have passed that exam, so there's no point for me to retake it. Out of curiosity, I want to learn…
Kim Stacks
  • 10,202
  • 35
  • 151
  • 282
1
vote
1 answer

Looking for algorithms: Minimum cut to produce bipartite graph

Given an undirected weighted graph (or a single connected component of a larger disjoint graph) which typically will contain numerous odd and even cycles, I am searching for algorithms to remove the smallest possible number of edges necessary in…
Robert Hairgrove
  • 35
  • 6
1
vote
1 answer

Max Flow Min Cut

So I have worked out that there is a Max Flow of 10, which therefore means there is a minimum cut also of 10 however how do I draw a minimum cut of 10 on this image?
TheRapture87
  • 1,403
  • 3
  • 21
  • 31
1
vote
2 answers

Is there any difference between graph cut and graph search?

Graph based methods have been used for medical image segmentation problems. Each pixel (voxel in 3D) in the image is represented by a node in the graph while edges connect neighboring nodes. In addition, two nodes namely source and sink are added. A…
Ruchir
  • 845
  • 2
  • 10
  • 24
1
vote
0 answers

Graph cuts and removal of edges

I am trying to understand some code from Vladimir Kolmogorov's excellent Graph cut library and I have a question regarding graph construction. Say I have a system of binary variables and I need to represent the following cut costs E(0, 0) E(0,…
Luca
  • 10,458
  • 24
  • 107
  • 234
1
vote
1 answer

Cut set of a graph, Boost Graph Library

I've been struggling a lot to figure out how to do this. I'm interested in quickly finding the cut set of a graph. I know that BGL supports finding the cut set by iteration over the colorMap arguments supported by, e.g., edmonds_karp_max_flow. The…
mje
  • 13
  • 1
  • 4
1
vote
1 answer

Minimum Cut by Karger MinCut Java Large Input Error

I have been working & trying to fix this for a while now. It has been quite a few weeks actually but I ran out of possible solutions or modifications. So the algorithm is a Randomized Karger Minimum Cut Algorithm & my implementation is provided…
Khan
  • 213
  • 2
  • 12
1
vote
1 answer

How to find a maximum flow in a planar graph?

I know an algo to find the minimum cut in a planar graph. Works as O(NlogN) You create a dual graph where each vertice corresponds to original's graph facet and edge corresponds to a minimum edge connecting two facets. Then you use Dijkstra to find…
user10732
  • 21
  • 3
0
votes
0 answers

how to implement in AMPL unsplittable flow and origin and destination contraint for a flow?

Good Morning guys, I really need your help, I'm trying to figure out a problem in my implementation of a min cost flow problem in AMPL. I have to create the code for the problem in the image: I tried this code, but I'm not able to solve the problem…
Alessia
  • 1
  • 1
0
votes
0 answers

How can I use min-cut to seperate a weighted directed graph into 2 subsets of a given size?

I have created a weighted directed graph of 21 nodes. I have to seperate this graph into two subgraphs of approximately equal size. I need either a 10/11 node division, or a 9/12 node division. My idea was to use min-cut. Program that with gvxopt…
floppiethethirth
  • 1
  • 1
0
votes
1 answer

Critical Edges and Bottleneck Edges in a Flow Network (Max-Flow/Min-Cut Problem)

A critical edge in a flow network G = (V,E) is defined as an edge such that decreasing the capacity of this edge leads to a decrease of the maximum flow. On the other hand, a bottleneck edge is an edge such that an increase in its capacity also…
John
  • 13
  • 1
  • 3
0
votes
1 answer

Is there a way to maximize the max flow of a graph by adjusting the weights within a certain range?

I've been learning about flow graphs and from what I've learned, a flow graph is a directed, weighted graph that has a certain maximum flow that can be calculated. However, is there a way to randomly weight the graph with values between a certain…
Sydney Faux
  • 3
  • 1
0
votes
2 answers

How do minimum multicut algorithms avoid trivial solutions?

I've been reading some papers on multicut algorithms for segmenting graph structures. I'm specifically interested in this work which proposes an algorithm to solve an extension of the multicut…
Ali250
  • 652
  • 1
  • 5
  • 19
0
votes
1 answer

Minimum cut over all pairs of vertices in directed and strongly connected graph

I have a graph G that is a directed and strongly connected graph, and I am asked to find a minimum cut over all pairs of vertices, meaning for every pair of S and T in the graph. This should be done in O(m2 × n2) time. The best I came up with was to…
Saik
  • 993
  • 1
  • 16
  • 40
0
votes
1 answer

Finding the minimum-cut value of graph using Kruskal's algorithm

I'm a beginner and I am trying to find the minimum cut of a graph using Kruskal's algorithm in Java. I have gotten to where I can read the input and create vertexCount^2 number of MST's with random weights for the edges. All I have left to do is…
hollaholl
  • 93
  • 1
  • 2
  • 10
1
2