Chinese postman problem

名词 n.
中文释义

英文释义

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

词形变化

Chinese postman problems plural

词源

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.
0 次浏览 数据来源: Wiktionary