Login / Signup

A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem.

Seyedmohammadhossein HosseinianDalila B. M. M. FontesSergiy Butenko
Published in: INFORMS J. Comput. (2020)
Keyphrases
  • bipartite graph
  • edge weights
  • social networks
  • lower bound
  • probabilistic model
  • upper bound