Bor Vka's Algorithm

Bor Vka's Algorithm

Edited by 

List price: US$37.99

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Bor vka's algorithm is an algorithm for finding a minimum spanning tree in a graph for which all edge weights are distinct. It was first published in 1926 by Otakar Bor vka as a method of constructing an efficient electricity network for Moravia. The algorithm was rediscovered by Choquet in 1938; again by Florek, ukasiewicz, Perkal, Steinhaus, and Zubrzycki in 1951; and again by Sollin in 1965. Because Sollin was the only computer scientist in this list living in an English speaking country, this algorithm is frequently called Sollin's algorithm, especially in the parallel computing more

Product details

  • Paperback | 60 pages
  • 152 x 229 x 4mm | 100g
  • String Publishing
  • United States
  • English
  • black & white illustrations
  • 6136191296
  • 9786136191294