Chinese postman problem
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Originally studied by the Chinese mathematician Kwan Mei-Ko in 1960, whose Chinese paper was translated into English in 1962. The name "Chinese postman problem" was coined in his honour, and is varyingly ascribed to Alan J. Goldman or Jack Edmonds, both of the US National Bureau of Standards.
Noun[edit]
Chinese postman problem (plural Chinese postman problems)
- (graph theory) The problem of finding the shortest closed path or circuit that visits every edge of a (connected) undirected graph.