L. R. Ford Jr., Date of Birth, Place of Birth, Date of Death

    

L. R. Ford Jr.

American mathematician

Date of Birth: 23-Sep-1927

Place of Birth: Houston, Texas, United States

Date of Death: 26-Feb-2017

Profession: mathematician

Nationality: United States

Zodiac Sign: Libra


Show Famous Birthdays Today, United States

👉 Worldwide Celebrity Birthdays Today

About L. R. Ford Jr.

  • Lester Randolph Ford Jr.
  • (September 23, 1927 – February 26, 2017) was an American mathematician specializing in network flow problems.
  • He was the son of mathematician Lester R.
  • Ford Sr.Ford's paper with D.
  • R.
  • Fulkerson on the maximum flow problem and the Ford–Fulkerson algorithm for solving it, published as a technical report in 1954 and in a journal in 1956, established the max-flow min-cut theorem.
  • In 1962 they published Flows in Networks with Princeton University Press.
  • According to the preface, it "included topics that were purely mathematically motivated, together with those that are strictly utilitarian in concept." In his review, S.W.
  • Golomb wrote, "This book is an attractive, well-written account of a fairly new topic in pure and applied combinatorial analysis." As a topic of continued interest, a new edition was published in 2010 with a new forward by Robert G.
  • Bland and James B.
  • Orlin.In 1956, Ford developed the Bellman–Ford algorithm for finding shortest paths in graphs that have negative weights, two years before Richard Bellman also published the algorithm.With Selmer M.
  • Johnson, he developed the Ford–Johnson algorithm for sorting, which is of theoretical interest in connection with the problem of doing comparison sort with the least number of comparisons.
  • For 20 years, this algorithm required the minimum number of comparisons.In 1963 along with his father Lester R.
  • Ford, he published an innovative textbook on calculus.
  • For a given function f and point x, they defined a frame as a rectangle containing (x, f(x)) with sides parallel to the axes of the plane (page 9).
  • Frames are then exploited to define continuous functions (page 10) and to describe integrable functions (page 148).

Read more at Wikipedia