Ford–Fulkerson algorithm

Summary

Ford–Fulkerson algorithm is an algorithm^[1]. It draws 241 Wikipedia views per month (algorithm category, ranking #46 of 337).^[2]

Key Facts

• Ford–Fulkerson algorithm's instance of is recorded as algorithm^[3].
• Ford–Fulkerson algorithm's instance of is recorded as graph algorithm^[4].
• L. R. Ford, Jr. is named after Ford–Fulkerson algorithm^[5].
• D. R. Fulkerson is named after Ford–Fulkerson algorithm^[6].
• Ford–Fulkerson algorithm's Commons category is recorded as Ford-Fulkerson's algorithm^[7].
• Ford–Fulkerson algorithm's Freebase ID is recorded as /m/0f2hc^[8].
• Ford–Fulkerson algorithm's computes solution to is recorded as maximum flow problem^[9].
• Ford–Fulkerson algorithm's Dictionary of Algorithms and Data Structures ID is recorded as fordFulkerson^[10].
• Ford–Fulkerson algorithm's Microsoft Academic ID is recorded as 2779767944^[11].
• Ford–Fulkerson algorithm's Brilliant Wiki ID is recorded as ford-fulkerson-algorithm^[12].

Body

Designation and Status

Recorded instance of include algorithm^[3] and graph algorithm^[4].

History and Context

Things named after include L. R. Ford, Jr.^[5], a mathematician^[13], 1927–2017^[14], of United States^[15] and D. R. Fulkerson^[6], a mathematician^[16], 1924–1976^[17], of United States^[18], awarded the Paul R. Halmos - Lester R. Ford Awards^[19], specialised in combinatorics^[20].

Why It Matters

Ford–Fulkerson algorithm draws 241 Wikipedia views per month (algorithm category, ranking #46 of 337).^[2] It has Wikipedia articles in 17 language editions, a strong signal of global cultural recognition.^[21] It is known by 12 alternative names across languages and contexts.^[22]