This preview shows page 1. Sign up to view the full content.
Unformatted text preview: What can you say about its running time? Problem 4. Consider the incorrect algorithm that tries to Fnd strongly connected compo-nents by processing the nodes in the second pass in order of Fnish time. (a) Briey give our intuition of why this is a good idea. (b) Show that the algorithm is incorrect (by giving a counterexample). (c) Briey explain why our intuition was incorrect. Problem 5. Do Exercise 6 on page 108 of Kleinberg and Tardos. Problem 6. A bridge in a connected, undirected graph G = ( V, E ) is an edge whose removal diconnects G . Give an ecient algorithm to Fnd all of the bridges in G . Write the pseudo-code. Try to make your algorithm clean and elegant. Justify the correctness of your algorithm. 1...
View Full Document
- Fall '08