Chinese postman problem

English

Etymology

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

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.

单词	Chinese postman problem
释义	Chinese postman problem English Etymology 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 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.
随便看	danificada danificadas danificado danificados danificai danificais danificam danificamos danificando danificar danificara danificaram danificaras danificardes danificarei danificareis danificarem danificaremos danificares danificaria danificariam danificarias danificarmos danificará danificarás