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

How to create "type" attribute for bipartite graph with igraph inR

i have a two-mode network edgelist data like tmp below: tmp <- read.table(text="PersonID CompanyID P1 C000001 P2 C000001 P3 C000001 P4 C000001 P5 C000001 P6 C000002 P7 C000002 P8 C000002 P9 C000003 P10 C000003 P11 C000003 P12…
user2309529
  • 1
0
votes
1 answer

Edge bi-partitioning, no triangles: complexity?

I've got to find an algorithm to solve a problem for faculty. I'm not requesting solutions (and please don't post any), just read further. The problem's sentence: ** Given a graph G = (V, E) find 2 sets S1 and S2 of edges of G such that: 1. S1 ∪…
John Xiba
  • 63
  • 4
0
votes
2 answers

Should vertex-order matter when trying to two-color a directed graph?

In The Algorithm Design Manual, the author provides an algorithm for two-coloring a graph. It's similar to the algorithm that counts the number of components, in that it iterates over all available vertices, and then colors and performs a BFS on…
Vivin Paliath
  • 94,126
  • 40
  • 223
  • 295
0
votes
1 answer

Sample dataset(s) for a maximum bipartite matching algorithm test?

I need to test some code I've written to solve the maximum bipartite matching problem. Does anyone know of any examples of large data sets I can use to test? Ideally, these would consist of numerical representations of bipartite graph, preferably of…
limp_chimp
  • 13,475
  • 17
  • 66
  • 105
0
votes
1 answer

How can I find the shortest cycle in an undirected bipartite graph using BFS ?

How can I find the shortest cycle in a simple (not directed ) bipartite graph using Breadth First Search ?
pantso
  • 3
  • 3
0
votes
1 answer

Algorithm to assign library books to members such that maximum members are satisfied

I was given a problem in a class test. In a library, each member requested for four books and each book was requested by only two members. This information is given in the form of bipartite graph G = ( X + Y , E ) X : Set of all members Y : Set of…
Shashwat Kumar
  • 5,159
  • 2
  • 30
  • 66
-1
votes
0 answers

Using bipartite network to compare two communities

So I am trying to use a bipartite network to link the influences of a group of species to microbiome data consisting of sequence reads for hundreds of other species. Any KIND and HELPFUL advice is appreciated! I have been able to run a simple…
Wesley Neely
  • 1
-1
votes
1 answer

Decay Centrality for Bipartite Graphs

How is decay centrality defined for a bipartite graph? I am unable to find a clear definition. All I got is https://www.centiserver.org/centrality/Decay_Centrality/. Which wasn't really helpful. Also, is there some nice implementation of decay…
Eshan Jain
  • 11
  • 2
-1
votes
1 answer

How to find largest bi-partite subgraph in the given graph?

Given an undirected unweighted graph : it may be cyclic and each vertex has given value ,as shown in image. Find the size of largest Bi-Partite sub-graph (Largest means maximum number of vertices (connected) in that graph) ? Answer: The…
tatya bichu
  • 1
  • 3
-1
votes
1 answer

Bipartite network error

I'm trying to analyse a bipartite network using the R bipartite package. I imported a csv file and converted it to a one mode network. Here's my code: library(igraph) library(bipartite) g <- as.network(data) net <- as.one.mode(g, fill = 0,…
Chamil
  • 1
  • 1
-1
votes
1 answer

Count matchings in bipartite graph

I am having a bipartite graph with N nodes in one side and almost 100 in other side. Now i need to count the matchings such that each node in first part is having a link to some node in other part such that no two nodes in first part matches to same…
user3907074
  • 1
  • 1
-1
votes
2 answers

Algorithm for selecting subset of people who use same stuff NP-hard?

This isn't homework, but a question I encountered during my research. I need to know whether this problem is NP-hard or not. In the first case, I require an approximate algorithm and in the latter case an efficient one providing me with the optimal…
Chris
  • 721
  • 1
  • 10
  • 23
-1
votes
1 answer

How to use igraph with python interface to project bipartite network?

I have a large data which is composed of one million lines, which makes up a bipartite network. One side of the network represents the APP, the other side represents the IP. The data format is : 1 1.1.1.1 1 …
GsM
  • 161
  • 1
  • 1
  • 13
-2
votes
1 answer

Bipartite graph c++

I must check whether a graph represented by a given adjacency matrix is a bipartite graph. I wrote some code, but it always returns false for the test adjacency matrix below, for which it should return true. Input: 10 0 1 0 0 1 0 0 0 0 0 1 0 0 0 0…
Yopp
  • 21
  • 2
-3
votes
7 answers

How we can determine Bipartiteness in apache age graph?

A graph is bipartite if and only if it is 2-colorable. Again A graph is bipartite if and only if every edge belongs to an odd number of bonds, minimal subsets of edges whose removal increases the number of components of the graph. I have tried it…
MAHMUDUL
  • 1
  • 2
1 2 3
…
25
26