Stack Overflow
Stack Overflow

Questions tagged [bipartite]

A bipartite graph (aka bigraph) is a graph whose vertices can be divided into two disjoint sets such that vertices from one set only connect to the vertices from the other set and not each other. Applications where they arise include resource planning and coding theory.

378 questions
4
votes
1 answer

Algorithm - A variant of Maximum Bipartite Matching

I am dealing with a variant of the Maximum Bipartite Matching problem. The original problem is as the following: There are M job applicants and N jobs. Each applicant has a subset of jobs that he/she is interested in. Each job opening can only…
Mr Cold
  • 1,565
  • 2
  • 19
  • 29
4
votes
1 answer

How to create a bipartite graph in GraphX

I am able to build a graph using a vertexRDD and an edgeRDD via the GraphX API, no problem there. i.e.: val graph: Graph[(String, Int), Int] = Graph(vertexRDD, edgeRDD) However, I don't know where to start if I want to use two separate vertexRDD's…
Christopher Mills
  • 711
  • 10
  • 28
4
votes
3 answers

Fast Maximum Matching Algorithm for Bipartite Graphs

I am trying to solve the following problem but my algorithm is too slow. That's because I am using Edmonds - Karp algorithm to find maximum flow which when applied to bipartite graphs gives maximum matching as well. It's running time is n^5. I would…
Varun Sharma
  • 2,591
  • 8
  • 45
  • 63
4
votes
2 answers

Skiena Design on Algorithm

I am stuck on a problem in Skiena's Design on Algorithms.I don't know if my solution is right. 5-18. Consider a set of movies M_1, M_2,.. M_k. There is a set of customers, each one of which indicates the two movies they would like to see this…
Mougart
  • 166
  • 2
  • 13
4
votes
1 answer

Is it possible to move subgraphs further apart in graphviz

I'm drawing a bipartite graph in graphviz and I want it to have two columns of nodes connected by straight lines (to match a style used elsewhere). I can mostly get what I want (see image) but the columns are too close together which makes the edges…
Carcophan
  • 1,508
  • 2
  • 18
  • 38
4
votes
5 answers

C# Many To Many Relationship

So, I need some way to implement an undirected network ( I think this is the correct term ) in C# Let's say I have the following data: Foo1 <-> Bar1 Foo2 <-> Bar1 Foo2 <-> Bar2 Foo2 <-> Bar3 Foo3 <-> Bar2 Foo3 <-> Bar3 How would I implement…
PostMan
  • 6,899
  • 1
  • 43
  • 51
4
votes
4 answers

Completely disconnecting a bipartite graph

I have a disconnected bipartite undirected graph. I want to completely disconnect the graph. Only operation that I can perform is to remove a node. Removing a node will automatically delete its edges. Task is to minimize the number of nodes to be…
Mukul Gupta
  • 2,310
  • 3
  • 24
  • 39
4
votes
3 answers

Best matching in a bipartite graph (e.g.associating labels with points on a plot)

I am trying to extract semantics from graphical xy plots where the points are plotted and some or all have a label. The label is plotted "near the point" so that a human can normally understand which label goes with which point. For example in this…
peter.murray.rust
  • 37,407
  • 44
  • 153
  • 217
3
votes
3 answers

BFS to check if a graph is bipartite in c++

I am implementing an algorithm to determine whether an undirected graph is bipartite or not. Based on this pseudo-code made ​​my implementation, which works for graphs connected, but when it is disconnected simply the program indicates a wrong…
franvergara66
  • 10,524
  • 20
  • 59
  • 101
3
votes
1 answer

How to get different maximum matchings

I have a large bipartite graph and I can find a maximum matching quickly using Hopcroft-Karp. But what I would really like is a few hundred different maximum matchings for the same graph. How can I get those? Here is an example small bipartite graph…
byteful
  • 309
  • 1
  • 8
3
votes
1 answer

How to draw a bipartite graph

if i want to simulate my network like this picture but Bipartite = 4 and increase my nodes to 600 node (n=150 l =150 s=150 and m=150) and also have 685 edges randomly...how can write simulation coding to make this network? can anyone help me ? enter…
ahmad
  • 73
  • 4
3
votes
2 answers

Bipartite connected graph proof

A friend presented me with a conjecture that seems to be true but neither of us can come up with a proof. Here's the problem: Given a connected, bipartite graph with disjoint non-empty vertex sets U and V, such that |U|<|V|, all vertices are in…
Joe Kelley
  • 289
  • 2
  • 5
3
votes
3 answers

Maximum bipartite matching in disconnected graph

How do you find the maximum bipartite matching when your graph has several components ? Each component can be colored in two ways. How do you decide the two sets X and Y in order to run the maximum matching routine ?
rohit89
  • 5,745
  • 2
  • 25
  • 42
3
votes
4 answers

(N x M) Diagramming Problem

I need an algorithm to (efficiently) solve a problem that has come up in some diagramming software that I am writing. I have two sets of nodes, N and M. Each node n0 in N has 0 to M connections to a unique (for n0) node in M. These sets of nodes…
RBarryYoung
  • 55,398
  • 14
  • 96
  • 137
3
votes
1 answer

NetworkX - Computing a maximum matching in a disconnected graph

I have two bipartite graphs G and B, both of which have exactly the same nodes, but a different number of edges. When I try to run nx.bipartite.maximum_matching on G (with the lower number of edges), I get an error Disconnected graph: Ambiguous…
monadoboi
  • 1,651
  • 3
  • 16
  • 26
1 2
3
…
25 26