InterviewSolution
Saved Bookmarks
| 1. |
You are given a graph containing n vertices and m edges and given that the graph doesn’t contain cycle of odd length. Time Complexity of the best known algorithm to find out whether the graph is bipartite or not is ?(A) O(m+n)(B) O(1)(C) O(mn)(D) O(n2) |
| Answer» | |