Fleury algorithm. ----- Ursprüngliche Mitteilung ----- > 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 > algoge...@googlegroups.com. To unsubscribe from this group, send email > to algogeeks+unsubscr...@googlegroups.com. For more options, visit this > group at http://groups.google.com/group/algogeeks?hl=en. >
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
