Unformatted text preview: Hint for problem set 8:
Try ﬁnding two paths P1 , P2 with the property that for every i ∈ C1 and j ∈ C2 ,
there exists a shortest i-to-j path in G that does not cross both P1 and P2 . 1 ...
View Full Document
- Fall '11
- Algorithms, shortest i-to-j path