Login / Signup

Tight lower bounds on the number of bicliques in false-twin-free graphs.

Marina GroshausLeandro Montero
Published in: Electron. Notes Discret. Math. (2015)
Keyphrases
  • lower bound
  • upper bound
  • small number
  • computational complexity
  • worst case
  • objective function
  • data structure
  • directed graph
  • branch and bound algorithm
  • graph theory
  • graph mining
  • maximal cliques