Bipartite Dimension
Jump to navigation
Jump to search
A Bipartite Dimension is a measure of the minimum number of complete bipartite subgraphs needed to cover all edges in E.
- AKA: Biclique Cover Number.
- See: Edge Covering, Combinatorial Optimization.
References
2015
- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/bipartite_dimension Retrieved:2015-10-8.
- In the mathematical fields of graph theory and combinatorial optimization, the bipartite dimension or biclique cover number of a graph G = (V, E) is the minimum number of bicliques (that is complete bipartite subgraphs), needed to cover all edges in E. A collection of bicliques covering all edges in G is called a biclique edge cover, or sometimes biclique cover. The bipartite dimension of G is often denoted by the symbol d(G).