Results 1 to 4 of 4
Thread: Creating Bipartite Graphs
- 03-08-2011, 03:47 PM #1
Member
- Join Date
- Nov 2010
- Posts
- 29
- Rep Power
- 0
- 03-08-2011, 05:15 PM #2
- Join Date
- Sep 2008
- Location
- Voorschoten, the Netherlands
- Posts
- 11,413
- Blog Entries
- 7
- Rep Power
- 17
The vertexes of a bipartite graph can be divided in two sets A and B such that no vertex a_i and a_j in set A have a connecting edge. Same goes for vertexes b_i and b_j in set B. You have to construct sets A and B from your graph. If a graph isn't bipartite you can't construct those sets A and B.
kind regards,
JosWhen people rob a bank they get a penalty; when banks rob people they get a bonus.
- 03-14-2011, 10:51 AM #3
Member
- Join Date
- Nov 2010
- Posts
- 29
- Rep Power
- 0
if i have the two sets A and B how can i generate a bipartite graph from it?
- 03-14-2011, 11:27 AM #4
- Join Date
- Sep 2008
- Location
- Voorschoten, the Netherlands
- Posts
- 11,413
- Blog Entries
- 7
- Rep Power
- 17
Similar Threads
-
Graphs and if else statement
By MapleLeafRag in forum New To JavaReplies: 1Last Post: 12-03-2009, 10:56 PM -
Creating 3D graphs
By idanfast in forum Advanced JavaReplies: 1Last Post: 09-06-2009, 04:42 PM -
Graphs
By siddharth_s_b in forum NetBeansReplies: 1Last Post: 05-22-2008, 04:12 AM -
Graphs
By javaplus in forum Advanced JavaReplies: 1Last Post: 12-07-2007, 09:17 PM


LinkBack URL
About LinkBacks
Reply With Quote

Bookmarks