Login / Signup
Tight lower bounds on the number of bicliques in false-twin-free graphs.
Marina Groshaus
Leandro Montero
Published in:
CoRR (2015)
Keyphrases
</>
lower bound
upper bound
random graphs
computational complexity
graph mining
small number
worst case
branch and bound
graph theory
lower and upper bounds
graph theoretic