MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have a graph of Points G(V,E) and I want to find the shortest path covering all the edge, I want the minimum number of edge repetitions . Which is the best way to reduce this problem to well know problems like TSP , Hamiltonian circuit , Hamltonian completion ?

Thank you.

share|cite|improve this question
Well, all you need is to take care of vertices of odd degree: you have to split all of them but 2 into pairs and joint the pairs so that the total length is minimal. That is exactly the optimal matching problem, which certainly belongs to the category of "well-known". – fedja Jul 17 '11 at 12:05
Thank you for your suggestion – Denis Jul 18 '11 at 8:21
up vote 5 down vote accepted

That is Chinese Postman Path. Search for Chinese Postman Problem...

E.g., this section from some book looks comprehensive:

share|cite|improve this answer
Thank you for the solution – Denis Jul 18 '11 at 8:21

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.