Difference between revisions of "Bipartite graph"
From Cohen Courses
Jump to navigationJump to searchm (1 revision: trying again...) |
|
(No difference)
| |
Latest revision as of 15:21, 7 September 2010
A bipartite graph is a graph where nodes can be divided into two groups V1 and V2 such that no edge connects the vertices in the same group.
examples of bipartite social graphs
- Author-conference database
- Peer to peer network (nodes vs files)
- Stock-broker graph
