Data Structures and Network Algorithms

This book attempts to provide the reader with a practical understanding and appreciation of the field of graph algorithms.

Robert Endre Tarjan (Author)

9780898711875, Society for Industrial and Applied Mathematics

Paperback / softback, published 1 February 1984

140 pages
25.2 x 17.9 x 0.8 cm, 0.24 kg

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 network optimization are covered in detail, including a development of the data structures they use and an analysis of their running time. Data Structures and Network Algorithms attempts to provide the reader with both a practical understanding of the algorithms, described to facilitate their easy implementation, and an appreciation of the depth and beauty of the field of graph algorithms.

Foundations
Disjoint Sets
Heaps
Search Trees
Linking and Cutting Trees
Minimum Spanning Trees
Shortest Paths
Network Flows
Matchings.

Subject Areas: Mathematical theory of computation [UYA], Network programming [UMR]