Copyright © Philip M. Parker, INSEAD. Terms of Use.

CHINESE POSTMAN PROBLEM

Specialty Definition: CHINESE POSTMAN PROBLEM

DomainDefinition

Math

Find a minimum length closed walk that traverses each edge at least once. Finding an optimal solution is NP-complete. (references)

Source: compiled by the editor from various references; see credits.

Top     

Anagrams: CHINESE POSTMAN PROBLEM

Scrabble® Enable2K-Verified Anagrams

Words within the letters "a-b-c-e-e-e-h-i-l-m-m-n-n-o-o-p-p-r-s-s-t"

-4 letters: complementariness.

Source: compiled by the editor from various references; see credits.

SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.

Top     

Alternative Orthography: CHINESE POSTMAN PROBLEM


Hexadecimal (or equivalents, 770AD-1900s) (references)

43 48 49 4E 45 53 45      50 4F 53 54 4D 41 4E      50 52 4F 42 4C 45 4D

Leonardo da Vinci (1452-1519; backwards) (references)

        

Binary Code (1918-1938, probably earlier) (references)

01000011 01001000 01001001 01001110 01000101 01010011 01000101 00100000 01010000 01001111 01010011 01010100 01001101 01000001 01001110 00100000 01010000 01010010 01001111 01000010 01001100 01000101 01001101

HTML Code (1990) (references)

&#67 &#72 &#73 &#78 &#69 &#83 &#69 &#32 &#80 &#79 &#83 &#84 &#77 &#65 &#78 &#32 &#80 &#82 &#79 &#66 &#76 &#69 &#77

ISO 10646 (1991-1993) (references)

0043 0048 0049 004E 0045 0053 0045      0050 004F 0053 0054 004D 0041 004E      0050 0052 004F 0042 004C 0045 004D

Encryption (beginner's substitution cypher): (references)

37424348395339250495354473548250524936463947

Top     



INDEX

1. Anagrams
2. Orthography
3. Bibliography


  

Copyright © Philip M. Parker, INSEAD. Terms of Use.