Robert C. Prim

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Robert Clay Prim (born September 25, 1921[1] in Sweetwater, Texas) is an American mathematician and computer scientist.

In 1941, Prim received his B.S. in Electrical Engineering from The University of Texas at Austin,[2] where he also met his wife Alice (Hutter) Prim (1921-2009), whom he wed in 1942. Later in 1949, he received his Ph.D. in Mathematics from Princeton University, where he also worked as a research associate from 1948 until 1949.

During the climax of World War II (1941–1944), Prim worked as an engineer for General Electric. From 1944 until 1949, he was hired by the United States Naval Ordnance Lab as an engineer and later a mathematician. At Bell Laboratories, he served as director of mathematics research from 1958 to 1961. There, Prim developed Prim's algorithm. After Bell Laboratories, Prim became vice president of research at Sandia National Laboratories.

During his career at Bell Laboratories, Robert Prim along with coworker Joseph Kruskal developed two different algorithms (see greedy algorithm) for finding a minimum spanning tree in a weighted graph, a basic stumbling block in computer network design. His self-named algorithm, Prim's algorithm, was originally discovered in 1930 by mathematician Vojtěch Jarník and later independently by Prim in 1957. It was later rediscovered by Edsger Dijkstra in 1959. It is sometimes referred to as the DJP algorithm or the Jarník algorithm.

References[edit]

  1. ^ "Texas Birth Index, Nolan County, 1903-1997". 
  2. ^ Obituary (February 22, 2009). "Alice (Hutter) Prim In Memoriam". Austin American-Statesmen. Retrieved May 3, 2013. 

External links[edit]