In graph theory, a branch of mathematics, the Chinese postman problem (CPP), postman tour or route inspection problem is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph. When the graph has an Eulerian circuit (a closed walk that covers every edge once), that circuit is an optimal solution.
Alan Goldman of the U.S. National Bureau of Standards first coined the name 'Chinese Postman Problem' for this problem, as it was originally studied by the Chinese mathematician Mei-Ku Kuan in 1962.
Read more about Route Inspection Problem: Eulerian Paths and Circuits, T-joins, Solution, Variants
Famous quotes containing the words route, inspection and/or problem:
“A Route of Evanescence
With a revolving Wheel—”
—Emily Dickinson (1830–1886)
“We had an inspection today of the brigade. The Twenty-third was pronounced the crack regiment in appearance, ... [but] I could see only six to ten in a company of the old men. They all smiled as I rode by. But as I passed away I couldn’t help dropping a few natural tears. I felt as I did when I saw them mustered in at Camp Chase.”
—Rutherford Birchard Hayes (1822–1893)
“If a problem is insoluble, it is Necessity. Leave it alone.”
—Mason Cooley (b. 1927)