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

Find a mapping in a bipartite graph

There is a square binary matrix that denotes connections in a bipartite graph. The question is: does there exist a one-to-one mapping of all rows to columns? (To be clear, if I'm using the language wrong, a fully connected graph satisfies this…
William Entriken
  • 37,208
  • 23
  • 149
  • 195
2
votes
1 answer

Find the second maximum weighed matching in a complete bipartite graph

Given a weighed complete bipartite graph G=(V, U, E), the maximum weighted bipartite matching problem, i.e., the assignment problem, aims to find a matching in G where the sum of edge weights is maximized. I know there are some methods (e.g.,…
John Smith
  • 617
  • 3
  • 16
2
votes
1 answer

Stop plot edges being cut off in bipartite package (plotweb)

With the plotweb() function in the bipartite package in R, I've created a network, but some of the labels are too long for the plot area. As a result, they are being cut off at the top and bottom (I've included a picture). I'm trying to make it fit…
Bobneedshelp
  • 35
  • 4
2
votes
1 answer

Change the position of labels in visweb() adjacency matrix plot from bipartite R package

I am conducting ecological network analysis, looking specifically at plant-pollinator mutualisms, using the bipartite package in R. I have used the visweb() function to create an adjacency matrix using the standard code provided in the bipartite…
acroceph
  • 21
  • 2
2
votes
0 answers

Given a bipartite graph, how to find the largest complete bipartite/biclique subgraph?

From a bipartite graph I wish to find the largest complete bipartite subgraph. From what I've been able to gather, finding complete subgraphs seem to be an NP problem. I'm completely lost as to how to approach this problem. Should I consider a brute…
Mercury
  • 3,417
  • 1
  • 10
  • 35
2
votes
1 answer

Maximum weighted bipartite matching for two sets of vertices of drastically different sizes

The abstract problem I want to find the best maximum matching in a complete weighted bipartite graph where the two sets of vertices differ drastically in size, i.e. one set of vertices is very large and the other one very small. The Hungarian…
Alex
  • 3,316
  • 4
  • 26
  • 52
2
votes
0 answers

NetworkX bipartite graph issues

Here's the set up: I have a data frame, df, with columns labeled A,B,...,K. Each entry of column A is unique and will make up one of the two sets of vertices, call it X, in a bipartite graph, G. The entries of columns B,...,K (not all unique) make…
Peter Lewis
  • 21
  • 1
2
votes
1 answer

Drawing a non-bipartite graph in MATLAB

I am looking to draw a graph in MATLAB. My graph is non-bipartite and the matrix for the graph is: A=[0 1 0 0 0 1 0 0 0 0 0 1 0 0 1 0 %1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 %2 0 1 0 1 0 0 1 0 0 0 0 0 0 0 0 0 %3 0 0 1 0 1 0 0 0 1 0 0 0…
Colm Mc Namara
  • 21
  • 2
2
votes
0 answers

How can I adjust the distance in a bipartite pie graph using igraph?

I am using igraph (R) to draw a bipartite graph with pie shaped vertices. Simple example: library(igraph) inc <- matrix(sample(0:1, 50, replace = TRUE, prob=c(2,1)), 10, 5) values <- lapply(1:15, function(x) sample(1:10,3)) g <-…
Deniz C.
  • 21
  • 1
2
votes
1 answer

Partitioning adjacency matrix of bipartite graph

Lets say I have a graph G with its adjacency matrix A. I know that G is bipartite. How can I split the vertices in G into the two sets that always form a bipartite graph? Thanks!
faximan
  • 324
  • 2
  • 15
2
votes
1 answer

Echarts 3 - Bipartite chart

1) Is it possible to create a bipartite chart using ECharts 3? Something like: http://bl.ocks.org/NPashaP/3ba0031d3d555afca4713e5264455025 2) Can be used a 'chord' chart in ECharts 3? Example with ECharts 2:…
Marco M
  • 50
  • 7
2
votes
0 answers

Time complexity of this bipartite matching algorithm

I was looking at some different ways to do bipartite matching and found this implementation http://www.geeksforgeeks.org/maximum-bipartite-matching/, am wondering what the time complexity for it is? Most things I've read seem to do bipartite…
tiggybits
  • 119
  • 1
  • 9
2
votes
1 answer

Visualizing collaboration network structure with existing R applications/packages

I am trying to visualize a relational data structure of "joint venture" (i.e., firms collaborate with others in products). For example, firm i may be involved in joint venture A with firm j, yet firm i also participates in joint venture B with firm…
Chris T.
  • 1,699
  • 7
  • 23
  • 45
2
votes
1 answer

Min Cost Flow Optimized for a Complete Bipartite Matching in Euclidean Space

The gist is... we have two sets of points A and B. Set A and B have the same number of points n. Formal Problem: Construct a minimum cost complete bipartite matching between points in A and B. The cost of a matching (a, b) is the distance(a, b).…
Michael Petrochuk
  • 467
  • 5
  • 16
2
votes
1 answer

Modifying a bipartite graph so that it would have a perfect matching

Given a bipartite graph with equal-sized sides X and Y, how can we efficiently find the minimum number of edges we have to add so that the graph will have a perfect matching? is there a better solution than iterating over all 2^(|X|) subsets and…
user1767774
  • 1,775
  • 3
  • 24
  • 32
1 2 3
…
25 26