Login / Signup

BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs.

Alexis BaudinClémence MagnienLionel Tabourier
Published in: CoRR (2024)
Keyphrases
  • learning algorithm
  • k means
  • optimal solution
  • np hard
  • bipartite graph
  • matching algorithm
  • graph model
  • search space
  • graph clustering
  • mutual reinforcement
  • maximum matching