There has been an explosive growth in the field of combinatorial algorithms. These algorithms depend not only on results in combinatorics and especially in graph theory, but also on the development of new data structures and new techniques for analyzing algorithms. Four classical problems in networ
Data structures and network algorithms
✍ Scribed by Robert Endre Tarjan
- Book ID
- 127424201
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 1987
- Tongue
- English
- Weight
- 1 MB
- Series
- CBMS-NSF regional conference series in applied mathematics 44
- Category
- Library
- City
- Philadelphia, Pa
- ISBN
- 0898711878
No coin nor oath required. For personal study only.
✦ Synopsis
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.
✦ Subjects
Алгоритмы и структуры данных
📜 SIMILAR VOLUMES
This book presents the data structures and algorithms that underpin much of today's computer programming. The basis of this book is the material contained in the first six chapters of our earlier work. The Design and Analysis of Computer Algorithms. We have expanded that coverage and have added mate