Home Work 6

Exercises from Chapter 4 (DG) and CLRS.
  1. Do Problem 4.4 (DG)
  2. Do Problem 4.8 (DG)
  3. Do Problem 4.13 a (DG)
  4. Problem 24.3.6 (CLRS Edition 3 Page 603. We are given a directed graph G =(V,E) on which each edge (u,v) in E has an associated value r(u,v), which is a real number in the range 0 ≤ r(u,v) ≤ 1 that represents the reliability of a communication channel from vertex u to vertex v. We interpet r(u,v) as the probability that the channel from u to v will not fail and we assume that these probabilities are independent. Give an efficient algorithm to find the most reliable path between two given vertices.
  5. (Optional Do not submit ) Do Problem 4.2 (DG)