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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced… (More)
  • figure 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
In May 2010 Yahoo! Inc. hosted the Learning to Rank Challenge. This paper summarizes the approach by the highly placed team… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
2009
2009
This paper summarizes the test results on several large-scale lighting systems based on a range of high-intensity-discharge (HID… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • table II
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We show that the demand for news varies with the perceived affinity of the news organization to the consumer’s political… (More)
  • table 2
  • figure 1
  • table 5
Is this relevant?
2006
2006
Loop Quantum Cosmology (LQC), mainly due to Bojowald, is not the cosmological sector of Loop Quantum Gravity (LQG). Rather, LQC… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2005
Highly Cited
2005
As processor speeds increase and memory latency becomes more critical, intelligent design and management of secondary caches… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
We discuss the reconstruction of piecewise smooth data from its (pseudo-) spectral information. Spectral projections enjoy… (More)
  • table 3.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
Is this relevant?
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… (More)
  • figure 1
  • table 1
  • table 2
Is this relevant?
Highly Cited
1996
Highly Cited
1996
One of the basic results in graph colouring is Brooks' theorem [-4] which asserts that the chromatic number of every connected… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
  • Emile H. L. Aarts
  • 1985
Statistical cooling is a new combinatorial optimization technique based on Monte-Carlo iterative improvement. The method… (More)
Is this relevant?