A

Admin • 832.70K Points
Coach

Q. What is testing of a complete bipartite subgraph in a bipartite graph problem called?

  • (A) p problem
  • (B) p-complete problem
  • (C) np problem
  • (D) np-complete problem

Explanation by: Admin

np stands for nondeterministic polynomial time. in a bipartite graph, the testing of a complete bipartite subgraph in a bipartite graph is an np-complete problem.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.