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
0
votes
2 answers

Error in an approach to Maximum Bipartite matching

A bipartite graph with a source and sink is given as shown below. The capacity of every edge is 1 unit : Source : GeeksforGeeks I'm trying to find the maximum flow from source to sink. One approach would be using the Ford-Fulkerson Algorithm for…
gautamk
  • 15
  • 1
  • 3
0
votes
1 answer

My collection of maximal matched edges comes back empty (using QuickGraph in C#)

I'm trying to use QuickGraph to, well, find a maximal matching in my bipartite graph, but the MatchedEdges collection they return to me is empty. I know there are matchings because I tested it with a K7,7 (complete bipartite) graph. So, I'm confused…
Bull Feathers
  • 31
  • 5
0
votes
1 answer

Algorithm design for Bipartite Matching.. children and clothing

Suppose you are a kindergarten teacher and you need to get your children dressed to go play outside. Each kid needs a hat, mittens, and a coat. Each child has preferences on which clothes they want to wear. We have n children, a hats, b pairs of…
Free Style
  • 1
0
votes
1 answer

Number of edge distinct paths in bipartite graph

We have a bipartite graph, where set A have n vertices and set B have n vertices. Also each vertices in set A have k edges to set B and each vertices in set B have k edges to set A. There is a special vertex s that has edges to all vertices to set…
Saik
  • 993
  • 1
  • 16
  • 40
0
votes
2 answers

check if the graph is bipartite or not

I'm learning about graphs, after I finished writing a code about BFS I did had a question in my mind that how can I improve my code to make it also to check if this graph is bipartite or not? using the same function. I want to color the nodes that…
user4585412
  • 55
  • 9
0
votes
1 answer

Copying values from a Map to a 256x256 array in a C++ program

I am working on a max bipartite matching algorithim. I am having trouble figuring out how to set values in an array based on the key/value in the map. Ultimately I need iterate through my rows, which correspond to my keys in the map mymap. And then…
Phi
  • 335
  • 9
  • 22
0
votes
1 answer

igraph: layout by node attribute

Is there a way to weigh layout according to node attributes in igraph? In other words, how to get nodes that share the same characteristics (but do not have edges between them) cluster more closely together? While many layout functions can take edge…
iemnar
  • 13
  • 2
0
votes
0 answers

Are there exact methods to solve the Path cover in bipartite graphs?

We consider a simple graph G =(V; E). The well known Path Cover problem (https://en.wikipedia.org/wiki/Path_cover) is NP-complete on all graph classes on which the Hamiltonian path problem is NP-complete, including planar graphs, bipartite graphs…
Farah Mind
  • 143
  • 5
0
votes
2 answers

Detect bi-cliques in r for bipartite graph

I am trying to recreate the Biclique Communities method (Lehmann, Schwartz, & Hansen, 2008) in R which relies on the definition of a Ka,b biclique. The example below shows two adjacent K2,2 bicliques - the first clique is {A,B,1,2} and the second…
JamesLee
  • 155
  • 7
0
votes
1 answer

Is finding whether k different perfect matchings exist in a bipartite graph co-NP?

Few definitions first. The co-NP problem is a decision problem where the answer "NO" can be verified in polynomial time. The perfect matching in a bipartite graph is a set of pairs of nodes (a pair is an edge in the graph) and where every node…
Traveling Salesman
  • 2,209
  • 11
  • 46
  • 83
0
votes
1 answer

Algorithm for conditioned migration

Literal description of the problem: Given a number of schools, each school holds a number of teachers according to its needs. At the end of the scholar year, some teachers ask for changing their positions (schools where they're currently teaching)…
Mohamed YOUNES
  • 69
  • 8
0
votes
1 answer

Maximum product perfect matching in complete bipartite graphs

I am trying to solve this problem : Jobs. So far i have thought that the problem is same as the Assignment Problem with the distributors and districts represented as a bipartite graph and the edges representing the probability. But here we would…
nishkr
  • 99
  • 1
  • 8
0
votes
2 answers

using loop to create a new list from previous list in r

I am executing a function (computeModules{bipartite}) which yields different results every time is run. I want to iterate the execution 100 times. The function's output consists of a list with several slots. I have to extract a matrix from one of…
Santi XGR
  • 185
  • 2
  • 13
0
votes
1 answer

Edge bipartization with equal number of nodes

I'm trying to solve the standard bipartization problem, i.e., find a subset of the edges such that the output graph is a bipartite graph. My additional constraints are: The number of vertices on each side must be equal. Each vertex has exactly 1…
Dani Pinkovich
  • 1
  • 2
0
votes
1 answer

Union grouping in bipartite graphs?

I'm trying to figure out a good (and fast) solution to the following problem: I have two models I'm working with, let's call them players and teams. A player can be on multiple teams and a team can have multiple players). I'm working on creating a…
Ian
  • 69
  • 1
  • 6
1 2 3
…
25 26