(definition)
Definition: An undirected graph where vertices can be partitioned into two sets such that no edge connects vertices in the same set.
Generalization (I am a kind of ...)
layered graph.
Note: A bipartite graph is a layered graph with two layers.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 11 April 2005.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "bipartite graph", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 11 April 2005. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/bipartgraph.html
