Login / Signup

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

Marina GroshausLeandro Montero
Published in: Theor. Comput. Sci. (2016)
Keyphrases
  • image registration
  • lower bound
  • upper bound
  • small number
  • neural network
  • np hard
  • optimal solution
  • computational complexity
  • special case