Chinese postman problem

短语

词形变化

Chinese postman problems 复数 Chinese postman problems

释义与例句

n.
  1. 1.

    The problem of finding the shortest closed path or circuit that visits every edge of a (connected) undirected graph.

    数学

词源

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.

来源：wiktionary