HW4 - HW4 Problems are for practice only(submission not...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
HW4. Problems are for practice only (submission not needed) . Solutions will be posted next Monday (April 14, 2003) 1. Problem 9 (page 337 of the textbook): Let G ( V , E ) be any connected undirected graph. A bridge of G is defined to be an edge of G which when removed from G , will make it disconnected. Present an O(| E |) time algorithm to find all the bridges of G . 2. Problem 10 (page 337 of the textbook): Let S ( V , T ) be any DFS tree for a given connected undirected graph G ( V , E ). Prove that a leaf of S cannot be an articulation point of G. 3. It is easy to see that for any graph G, both DFS and BFS will take almost the same amount of time. However, the space requirement may be considerably different. (a) Give an example of an n -vertex graph for which the depth of recursion of DFS starting from a particular vertex v is n -1 whereas the queue of BFS has at most one vertex at any given time if BFS is started from the same vertex v. (b) Give an example of an
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/27/2011 for the course COT 5405 taught by Professor Ungor during the Fall '08 term at University of Florida.

Page1 / 2

HW4 - HW4 Problems are for practice only(submission not...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online