Loading... Please wait...

Data Structures and Network Algorithms

Hover over image to zoom

Order Code:

 Product Description

by Robert Endre Tarjan


1983 / vii + 131 pages / Softcover / ISBN: 978-0-898711-87-5 / List Price $59.50 / SIAM/CBMS Member Price $41.65 / Order Code CB44

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.

Adopted for classroom use by Harvard University, Dartmouth University, the University of Chicago, the University of Colorado, Brown University, the University of Pennsylvania, Johns Hopkins University, and Princeton University (partial listing).

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

ISBN: 9780898711875 

 Find Similar Products by Category

Vendors Other Products

 Product Reviews

This product hasn't received any reviews yet. Be the first to review this product!

You Recently Viewed...



Follow us on

Copyright 2019 SIAM Bookstore. All Rights Reserved.
Sitemap | BigCommerce Premium Themes by PSDCenter

Society for Industrial and Applied Mathematics 3600 Market St., 6th Fl. Philadelphia, PA 19104-2688 USA +1-215-382-9800 FAX: +1-215-386-7999 www.siam.org email: siambooks@siam.org

Click the button below to add the Data Structures and Network Algorithms to your wish list.