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 path from the source to the sink along which the flow can be increased and increase the flow. Repeat until there are no such paths. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)46 4F 52 44 2D 46 55 4C 4B 45 52 53 4F 4E 4D 45 54 48 4F 44 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000110 01001111 01010010 01000100 00101101 01000110 01010101 01001100 01001011 01000101 01010010 01010011 01001111 01001110 00100000 01001101 01000101 01010100 01001000 01001111 01000100 |
HTML Code (1990) (references)F O R D - F U L K E R S O N   M E T H O D |
ISO 10646 (1991-1993) (references)0046 004F 0052 0044 002D 0046 0055 004C 004B 0045 0052 0053 004F 004E 004D 0045 0054 0048 004F 0044 |
Encryption (beginner's substitution cypher): (references)40495238154055464539525349482473954424938 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
