Data structures and network algorithms

Data structures and network algorithms The first half of the book covers the data structures used in solving the network problems that are presented in the second half. These data structures including disjoint sets, heaps, and search trees. Highlights of this half of the book are Tarjan's proof of the amoritized cost of union find, and explaination of self-adjusting binary trees.The second half of the book covers four classical network problems: minimum spanning tree, shortest paths, network flows (e.g. min-cut), and matchings.

Authors: Tarjan R.E.Pages: 131     Year: 1983

Tags: data algorithms network structures tarjan
   

Customers who bought this item also bought:



Dleex

© 2007–2018 Dleex.

English      German      French      Russian

For any question please write to our email e-mail