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:
“By whatever means it is accomplished, the prime business of a play is to arouse the passions of its audience so that by the route of passion may be opened up new relationships between a man and men, and between men and Man. Drama is akin to the other inventions of man in that it ought to help us to know more, and not merely to spend our feelings.”
—Arthur Miller (b. 1915)
“Hermann Goering, Joachim von Ribbentrop, Albert Speer, Walther Frank, Julius Streicher and Robert Ley did pass under my inspection and interrogation in 1945 but they only proved that National Socialism was a gangster interlude at a rather low order of mental capacity and with a surprisingly high incidence of alcoholism.”
—John Kenneth Galbraith (b. 1908)
“Will women find themselves in the same position they have always been? Or do we see liberation as solving the conditions of women in our society?... If we continue to shy away from this problem we will not be able to solve it after independence. But if we can say that our first priority is the emancipation of women, we will become free as members of an oppressed community.”
—Ruth Mompati (b. 1925)