Article ID: | iaor2012405 |
Volume: | 62 |
Issue: | 3 |
Start Page Number: | 637 |
End Page Number: | 658 |
Publication Date: | Apr 2012 |
Journal: | Algorithmica |
Authors: | Kratsch Dieter, Liedloff Mathieu, Gaspers Serge |
Keywords: | sets |
Bicliques of graphs have been studied extensively, partially motivated by the large number of applications. In this paper we improve Prisner’s upper bound on the number of maximal bicliques (Combinatorica, 20, 109–117, 2000) and show that the maximum number of maximal bicliques in a graph on