bipartite

问题 I have a large ( 36k vertices, 50k edges ) weighted bimodal bipartite graph and I would like to generate a projection that not only count the neighbors like the default weighted implementation but also sum the weights on the edges. You can think of it as a bipartite graph containing black vertices and blue vertices, where I want to conserve the original graph weights when there are only blue vertices. The implementations I came across keep the orange value, I am interested on the red one (or

问题 I have a large ( 36k vertices, 50k edges ) weighted bimodal bipartite graph and I would like to generate a projection that not only count the neighbors like the default weighted implementation but also sum the weights on the edges. You can think of it as a bipartite graph containing black vertices and blue vertices, where I want to conserve the original graph weights when there are only blue vertices. The implementations I came across keep the orange value, I am interested on the red one (or

问题 I am trying to create valued bipartite projection from my data which looks like the following: Name rid Emile 17560 Lou 11800 Luther 11800 Tot 11800 Phineas 11800 Phineas 13580 Calvin 13580 Calvin 11800 Les 11800 Jeff 11800 Sonny 13580 Leon 13580 Red 13580 I imported the above data and call it data1 Then I do the following: ##create graph object from data1 graph1 <- graph.data.frame(data1) #check if it is bipartite is.bipartite(graph1) FALSE ##convert to bipartite graph V(graph1)$type <- V

问题 I am trying to figure out an algorithm for finding minimum vertex cover of a bipartite graph. I was thinking about a solution, that reduces the problem to maximum matching in bipartite graph. It's known that it can be found using max flow in networ created from the bip. graph. Max matching M should determine min. vertex cover C, but I can't cope with choosing the vertices to set C. Let's say bip. graph has parts X, Y and vertices that are endpoints of max matching edges are in set A, those

问题 Although we can check a if a graph is bipartite using BFS and DFS (2 coloring ) on any given undirected graph, Same implementation may not work for the directed graph. So for testing same on directed graph , Am building a new undirected graph G2 using my source graph G1, such that for every edge E[u -> v] am adding an edge [u,v] in G2. So by applying a 2 coloring BFS I can now find if G2 is bipartite or not. and same applies for the G1 since these two are structurally same. But this method is

问题 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 algorithm is not a good approach for this problem since it adds dummy vertices to the smaller set such that the two sets have the same size, so I lose all the potential efficiency gains from one of the vertex sets being only very small. More concretely I

问题 Hi I am having trouble trying to get ifelse statements to work in a plotweb fuction (from bipartite ) to color interaction based on the total quantity of interaction of each cell in the matrix. I had the same problem with the high bar colors, but since there were only a few values and one vector, it was easy to manually code. Here is the code I am using, I want to color interactions greater than 15 as dark turquoise and keep the rest as default grey (grey80). I have tried many different

问题 I seen examples of jgraph and jgrapht and there easy to follow but now sure how I would go about using the CompleteBipartiteGraph? How is the syntax to be used to instantiate the graph? http://jgrapht.org/javadoc/ http://jgrapht.org/javadoc/org/jgrapht/generate/CompleteBipartiteGraphGenerator.html 回答1: In response to the question "Could I still use this generator?" from the comment: You could still use it to create a complete bipartite graph, and then randomly remove some edges. But a more

问题 my question is awkwardly simple: how do i plot a bipartite graph in Gephi with a layout like the one you see in the attached image? I really am not able to find an appropriate layout in Gephi's options thanks 回答1: Gephi version 0.9.1 has an Event Graph Layout plugin that will do this: Tools -> Plugins -> Available Plugins . Under Data Laboratory, you'll need to add an integer-level variable to your Nodes data table ("Mode" for example), set all of your B nodes to 1, and all of your R nodes to

问题 I need to write a program that check if a graph is bipartite. I have read through wikipedia articles about graph coloring and bipartite graph. These two article suggest methods to test bipartiteness like BFS search, but I cannot write a program implementing these methods. 回答1: Why can't you? Your question makes it hard for someone to even write the program for you since you don't even mention a specific language... The idea is to start by placing a random node into a FIFO queue (also here).