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
0
votes
1 answer

Maximum Cardinality in Bipartite Graph

Is the maximum cardinality in a bipartite graph same as the maximum flow in that graph with two dummy nodes one as source other as sink. Source is connected to one set of bipartite graph and the other set is connected to the sink.
Amit Kumar
  • 1,477
  • 1
  • 16
  • 27
0
votes
1 answer

Filter list before writing to CSV in python

I've created a function to project a bipartite edgelist into a single mode edgelist, and everything works as it should. However, my existing plan has been to add all these edges to a list, then load that list into a pandas dataframe, and filter the…
CurtLH
  • 2,329
  • 4
  • 41
  • 64
0
votes
2 answers

How to convert a species by species interaction matrix into a dataframe?

I have a species by species interaction network, with predator identity in the first row and prey identity in the first column. The matrix is filles with 0 or 1 representing the presence or absence of an interaction. I would like to convert this…
user34771
  • 455
  • 1
  • 4
  • 15
0
votes
1 answer

Bipartite projection and write to CSV with NetworkX -- how to speed up writing to handle large file

I have a pretty big file (3 million lines) with each line being a person-to-event relationship. Ultimate, I want to project this bipartite network onto a single-mode, weighted, network, and write it to a CSV file. I'm using NetworkX, and I've…
CurtLH
  • 2,329
  • 4
  • 41
  • 64
0
votes
0 answers

Iterating over the possible flows in a bipartite graph

Consider a directed bipartite graph where both vertex sets A and B have m weighted vertices. Edges go only from A to B, and All vertices in A have the same degree which we denote n. The vertex weights are upper bounded by their degree. As an…
Martin Lauridsen
  • 341
  • 4
  • 12
0
votes
1 answer

Minimum Vertex Cover On A Bipartite Graph

Let’s say you have a bipartite graph G = (V, U, E) v1 is connected to u1, u2, and u3 v2 is connected to u2 and u3 v3 is connected to u3. By looking at the graph, I know that the minimum vertex covers are {v1, v2, u3} and {v1, u2, u3}, but I’m not…
0
votes
1 answer

How can a directed cycle exist in the residual graph of a Bipartite Flow Network with a perfect matching?

I am studying the analysis of algorithms. I am currently reading on Network Flow algorithms. I am considering an application of Network Flow algorithms concerning finding bipartite matchings of minimum cost. Let G with corresponding Network Flow…
Brian
  • 7,098
  • 15
  • 56
  • 73
0
votes
1 answer

Java jgraph applet visualize bipartite graph

I having problem getting jgrapht or jgraph or applet to visualize this graph correctly? Can I use this graph library to visualize similarly to the picture beneath? U would be x and V would be Y in the code for example. I'm using the demo versions…
MAXGEN
  • 735
  • 1
  • 10
  • 21
0
votes
2 answers

Creating a Bipartite Graph that extends Graph class. Need some guidance

Looking for a step in the right direction. I have with me 4 classes that I have made. One is the super class which is graph and 3 subclasses called Edge, DirectedGraph, and BipartiteGraph. I am having some trouble with creating a bipartite graph.…
0
votes
1 answer

edmonds algorithm for bipartite maximum matching

I want to find the maximum matching in a bipartite matching using edmonds algorithm. Unfortunately I am unable to get the pseudo-code. Can anyone help me?
bulbasaur
  • 49
  • 1
  • 1
  • 6
0
votes
1 answer

Easiest implementation of a barpartite graph in javascript?

I'm working on a project that the algorithm requires using a bipartite graph, and I'm wondering what the best, or rather easiest, way of creating such a data structure in javascript is? I haven't been able to find any good explanations online, so if…
Tom
  • 141
  • 1
  • 10
0
votes
1 answer

What should I use to implement weighted bipartite matching algorithm in c++?

I have a project, it asks me to distribute the courses to the students.All students asks for some of courses but they are only allowed to get some number of them(it could be what they demand,less than it or just 0),all the courses have quotas and i…
McOne
  • 3
  • 3
0
votes
1 answer

How to convert SPOJ Quest4 to Minimum Vertex Cover

The following is a Maximum Bipartite matching problem : http://www.spoj.com/problems/QUEST4/ Through forums i came to know that the problem can be converted into a Minimum Vertex Cover problem, which in turn can be solved by Maximum Bipartite…
rohitjv
  • 187
  • 8
0
votes
1 answer

Checking for bipartite-ness in a large graph, made up of several disconnected graphs?

I was doing a problem on SPOJ SPOJ:BUGLIFE It required me to check whether the graph was bipartite or not. I know the method for a single connected graph, but for a combination of disconnected graphs, my method gives Time limit exceeded error.…
0
votes
1 answer

Optimizing an indexing script for a bipartite graph

I'm analyzing network and semantic values of tweets I downloaded on a given subject and geolocation, using bipartite graph. Using Python, I create a .net file containing the 2 sets of nodes and the edges. This file is a merge of files I created…
timeitself
  • 33
  • 1
  • 5