Login / Signup

A note on a Caro-Wei bound for the bipartite independence number in graphs.

Shimon Kogan
Published in: Discret. Math. (2021)
Keyphrases
  • graph model
  • upper bound
  • search algorithm
  • small number
  • real time
  • data mining
  • case study
  • optimal solution
  • computational complexity
  • bipartite graph
  • undirected graph