Unformatted text preview: C . In class we saw how to ﬁnd a circulation θ such that η + θ is the desired ﬂow γ by using a single shortest path computation in the dual with respect to the lengths cη (residual capacities), which might be negative. Show how to ﬁnd such a circulation θ without using an algorithm for shortest paths with negative lengths. 2. Present a drawing of an embedding of K 3 , 3 in the projective plane, specify its embedding scheme, and list its facial walks....
View
Full
Document
This note was uploaded on 01/20/2012 for the course CS 6.889 taught by Professor Erikdemaine during the Fall '11 term at MIT.
 Fall '11
 ErikDemaine
 Algorithms

Click to edit the document details