The question is to find the length of the smallest cycle in a bipartite graph G=(V,E) (V - vertices, E - edges).
Required time complexity: O(|V|^2) A given graph is bipartite iff it has no odd length cycles. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
