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:
“But however the forms of family life have changed and the number expanded, the role of the family has remained constant and it continues to be the major institution through which children pass en route to adulthood.”
—Bernice Weissbourd (20th century)
“Thus the orb he roamed
With narrow search, and with inspection deep
Considered every creature, which of all
Most opportune might serve his wiles, and found
The serpent subtlest beast of all the field.”
—John Milton (1608–1674)
“Involuntary mental hospitalization is like slavery. Refining the standards for commitment is like prettifying the slave plantations. The problem is not how to improve commitment, but how to abolish it.”
—Thomas Szasz (b. 1920)