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)
“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)
“The problem of the novelist who wishes to write about a man’s encounter with God is how he shall make the experience—which is both natural and supernatural—understandable, and credible, to his reader. In any age this would be a problem, but in our own, it is a well- nigh insurmountable one. Today’s audience is one in which religious feeling has become, if not atrophied, at least vaporous and sentimental.”
—Flannery O’Connor (1925–1964)