Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | (1) A heuristic algorithm to find a near-optimal solution to the traveling salesman problem. Step 1: find a minimum spanning tree T. Step 2: find a perfect matching M among vertices with odd degree. Step 3: combine the edges of M and T to make a multigraph G. Step 4: find an Euler cycle in G by skipping vertices already seen. (2) An algorithm to find the chromatic number of a graph. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)43 48 52 49 53 54 4F 46 49 44 45 53 41 4C 47 4F 52 49 54 48 4D |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000011 01001000 01010010 01001001 01010011 01010100 01001111 01000110 01001001 01000100 01000101 01010011 00100000 01000001 01001100 01000111 01001111 01010010 01001001 01010100 01001000 01001101 |
HTML Code (1990) (references)C H R I S T O F I D E S   A L G O R I T H M |
ISO 10646 (1991-1993) (references)0043 0048 0052 0049 0053 0054 004F 0046 0049 0044 0045 0053 0041 004C 0047 004F 0052 0049 0054 0048 004D |
Encryption (beginner's substitution cypher): (references)3742524353544940433839532354641495243544247 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
