Definitions from Wiktionary (Chinese postman problem)
▸ noun: (graph theory) The problem of finding the shortest closed path or circuit that visits every edge of a (connected) undirected graph.
▸ Words similar to Chinese postman problem
▸ Usage examples for Chinese postman problem
▸ Idioms related to Chinese postman problem
▸ Wikipedia articles (New!)
▸ Words that often appear near Chinese postman problem
▸ Rhymes of Chinese postman problem
▸ Invented words related to Chinese postman problem
▸ noun: (graph theory) The problem of finding the shortest closed path or circuit that visits every edge of a (connected) undirected graph.
Similar:
Canadian traveller problem,
snake-in-the-box problem,
Eppstein's algorithm,
Hamiltonian path,
circuit,
dipath,
path length,
closeness,
cycle,
superpath,
more...
▸ Words similar to Chinese postman problem
▸ Usage examples for Chinese postman problem
▸ Idioms related to Chinese postman problem
▸ Wikipedia articles (New!)
▸ Words that often appear near Chinese postman problem
▸ Rhymes of Chinese postman problem
▸ Invented words related to Chinese postman problem