Unformatted text preview: the total number of streets that you have to visit. This can be formulated as a graph problem: given a connected graph G ( V,E ), ﬁnd a closed walk of minimum length that traverses every edge at least once. (a) Give a polynomial time algorithm that gives a closed walk of length at most 2 | E | . (b) (Harder) Give a polynomial time algorithm that gives a closed walk of length at most | E | + | V | -1. 1...
View Full Document
- Winter '09
- Graph Theory, polynomial time algorithm, route inspection problem