Route Inspection Problem

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:

    no arranged terror: no forcing of image, plan,
    or thought:
    no propaganda, no humbling of reality to precept:
    terror pervades but is not arranged, all possibilities
    of escape open: no route shut,
    Archie Randolph Ammons (b. 1926)

    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)

    Consciousness is what makes the mind-body problem really intractable.
    Thomas Nagel (b. 1938)