Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | Given a flow function and its corresponding residual graph (a maximum-flow problem), select a vertex with the least throughput and greedily push the maximum flow from it to the sink. This is repeated until all vertices are deleted. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)4D 41 4C 48 4F 54 52 41 2D 4B 55 4D 41 52 2D 4D 41 48 45 53 48 57 41 52 49 42 4C 4F 43 4B 49 4E 47 46 4C 4F 57 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01001101 01000001 01001100 01001000 01001111 01010100 01010010 01000001 00101101 01001011 01010101 01001101 01000001 01010010 00101101 01001101 01000001 01001000 01000101 01010011 01001000 01010111 01000001 01010010 01001001 00100000 01000010 01001100 01001111 01000011 01001011 01001001 01001110 01000111 00100000 01000110 01001100 01001111 01010111 |
HTML Code (1990) (references)M A L H O T R A - K U M A R - M A H E S H W A R I   B L O C K I N G   F L O W |
ISO 10646 (1991-1993) (references)004D 0041 004C 0048 004F 0054 0052 0041 002D 004B 0055 004D 0041 0052 002D 004D 0041 0048 0045 0053 0048 0057 0041 0052 0049 0042 004C 004F 0043 004B 0049 004E 0047 0046 004C 004F 0057 |
Encryption (beginner's substitution cypher): (references)4735464249545235154555473552154735423953425735524323646493745434841240464957 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
