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

Minimum path cover in DAG

I want to know if there exists an efficient algorithm for computing the minimum path-cover in a Directed Acyclic Graph. Please don't confuse the minimum "path-cover" with "vertex-disjoint path-cover". For the latter, I know an efficient algorithm…
divanshu
  • 335
  • 1
  • 5
  • 12
3
votes
2 answers

bipartite projection without the intermediate bipartite graph

I have a data.frame which describes a bipartite graph with a very large (millions) and a reasonably small (hundreds) independent sets. I want to get the bipartite projection of the graph on the smaller independent set, but without first creating the…
sds
  • 58,617
  • 29
  • 161
  • 278
3
votes
3 answers

bipartite minimum edges

I looking for a simple algorithm getting the minimum weighted edge among the edges for a bipartite graph. I searched and I all could know it means the cover edge of a bipartite in other words if we have bipartite graph and each edge has a number…
esraaelsayed
  • 39
  • 1
  • 7
3
votes
1 answer

Combinations of "products" to form a sales promotion

I am re-developing a legacy system that matches a basket of user selected retail products into one or more valid promotions. These promotions are the industry standard BOGOF (buy one get one free), buy two get third free, buy product X and Y and get…
Nick Williams
  • 95
  • 1
  • 9
3
votes
1 answer

Brute Force Algorithm for finding maximum independent vertex set in bipartite graph?

Does anyone know the the generic outline for the brute force algorithm for finding the maximum independent vertex set in a bipartite graph? I know there are other algorithms such as König's Theorem for finding MIS, but I was wondering what the…
user1084113
  • 932
  • 3
  • 15
  • 31
3
votes
2 answers

How can I find a non-perfect bipartite matching of a graph?

That is, how can I find a bipartite matching of a graph where some vertices may not be connected to any other vertices? EDIT: One more condition, suppose the edges are also weighted, and I'd like a matching such that the total edge weight is…
John Zhang
  • 518
  • 1
  • 5
  • 12
2
votes
2 answers

Random spanning trees of bipartite graphs

I'm working on making some code using metaheuristics for finding good solutions to the Fixed Charge Transportation Problem (FCTP). The problem I'm having is to generate a starting solution, based on finding a spanning tree for the underlying…
Undreren
  • 2,811
  • 1
  • 22
  • 34
2
votes
1 answer

Bipartite matching in graph

I have the following code which is an implementation of BPM (bipartite matching, from graph theory) #include #include using namespace std; #define M 128 #define N 128 bool graph[M][N]; bool seen[N]; int matchL[M],matchR[N]; int…
user466534
2
votes
2 answers

Scheduling T teacher having max S students into S slots

There are T teachers who can each have a maximum of S students. Each student can have a maximum of S teachers. There are S time slots for the student and teacher to meet. In each slot a teacher will teach one of its student and then teacher gets…
Abhinay Pandey
  • 46
  • 3
  • 15
2
votes
1 answer

Why can't we determine if a graph is bipartite with simple iteration?

This is the problem I'm trying to solve We want to split a group of n people (labeled from 1 to n) into two groups of any size. Each person may dislike some other people, and they should not go into the same group. Given the integer n and the array…
Alec
  • 8,529
  • 8
  • 37
  • 63
2
votes
1 answer

Is there a way to return the edges used in a minimum weight matching on a bipartite graph?

I've been using networkx to find the minimum weight full matching for my bipartite graph but I have been unable to find the result edges used in this minimum matching (or at least the weight of the result graph). If anyone knows how to do this any…
anon
  • 21
  • 1
2
votes
2 answers

How do I create a random bipartite graph with fixed degree sequence?

I would like generate a random bipartite graph with a fixed degree sequence in igraph or other r package. I am familiar with how to generate a random graph with a fixed degree sequence and how to generate random bipartite graph in igraph--but I…
avgoustisw
  • 213
  • 1
  • 7
2
votes
1 answer

igraph: How to convert a graph to a bipartite graph?

I have a simple graph in igraph as follows: > myGraph IGRAPH 9689c03 DN-- 11 8 -- + attr: name (v/n), types (v/n), col (v/n), degree (v/n) + edges from 9689c03 (vertex names): [1] 2-> 7 2-> 8 2-> 9 2->10 3->11 3->12 3->13 3->14 Although it is a…
Amin Kaveh
  • 117
  • 6
2
votes
1 answer

bipartite network Degree-preserving randomization with constraints

I am working on a sample data containing several papers, the topics they belong to, and the publication years of those papers, it looks like…
Xiancheng LI
  • 21
  • 2
2
votes
3 answers

How to choose a productive group of employees?

I have employees and matrix with ranks how are they working with each other with the results from 0 to 10. I have to select groups with two people and give them work. The problem is I don't know how should I choose groups that sum up group works…
Gevorg Harutyunyan
  • 371
  • 2
  • 14
1 2 3
…
25 26