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

MAXIMUM-FLOW PROBLEM

Specialty Definition: MAXIMUM-FLOW PROBLEM

DomainDefinition

Math

The problem of finding the maximum flow between any two vertices of a graph. (references)

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

Top     

Crosswords: MAXIMUM-FLOW PROBLEM

Specialty definitions using "MAXIMUM-FLOW PROBLEM": Ford-Fulkerson method ♦ Malhotra-Kumar-Maheshwari blocking flow, multi-commodity flow. (references)

Top     

Alternative Orthography: MAXIMUM-FLOW PROBLEM


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

4D 41 58 49 4D 55 4D 2D 46 4C 4F 57      50 52 4F 42 4C 45 4D

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

    

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

01001101 01000001 01011000 01001001 01001101 01010101 01001101 00101101 01000110 01001100 01001111 01010111 00100000 01010000 01010010 01001111 01000010 01001100 01000101 01001101

HTML Code (1990) (references)

&#77 &#65 &#88 &#73 &#77 &#85 &#77 &#45 &#70 &#76 &#79 &#87 &#32 &#80 &#82 &#79 &#66 &#76 &#69 &#77

ISO 10646 (1991-1993) (references)

004D 0041 0058 0049 004D 0055 004D 002D 0046 004C 004F 0057      0050 0052 004F 0042 004C 0045 004D

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

473558434755471540464957250524936463947

Top     



INDEX

1. Crosswords
2. Orthography
3. Bibliography


  

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