Skip to search formSkip to main contentSkip to account menu

Bipartite dimension

Known as: Biclique edge cover, Bipartite clique cover, Biclique covering 
In the mathematical fields of graph theory and combinatorial optimization, the bipartite dimension or biclique cover number of a graph G = (V, E) is… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Deployable structures are structures that transform their shape from a compact state to an extended in-service position… 
Highly Cited
2013
Highly Cited
2013
This paper proposes a simulation-based optimization (SO) method that enables the efficient use of complex stochastic urban… 
Highly Cited
2009
Highly Cited
2009
We define Recursive Markov Chains (RMCs), a class of finitely presented denumerable Markov chains, and we study algorithms for… 
Highly Cited
2004
Highly Cited
2004
The 1897 Shillong (Assam), northeast India, earthquake is considered to be one of the largest in the modern history. Although… 
Highly Cited
2001
Highly Cited
2001
Shifting the focus from fear, guilt, and indignation related to deteriorating environmental quality, the authors hypothesized… 
Highly Cited
1999
Highly Cited
1999
We consider re-keying protocols for secure multicasting in a dynamic multicast group with a center. There is a variety of… 
Highly Cited
1999
Highly Cited
1999
Models for the evolution of the integrated energy spectrum of primary cosmic-ray electrons in clusters of galaxies have been… 
Highly Cited
1998
Highly Cited
1998
In this paper we further explore a class of high order TVD (total variation diminishing) Runge-Kutta time discretization… 
Highly Cited
1985
Highly Cited
1985
Statistical cooling is a new combinatorial optimization technique based on Monte-Carlo iterative improvement. The method… 
Highly Cited
1961
Highly Cited
1961
SummaryMeasurements during the drift of “US Drifting Station A” show an annual mass increase of old ice consisting of 12.5 g/cm2…