Data Structures and Network Algorithms (Paperback)

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.

General

Imprint:	Society For Industrial & Applied Mathematics,U.S.
Country of origin:	United States
Series:	CBMS-NSF Regional Conference Series, v. 44
Release date:	February 1984
First published:	1987
Authors:	Robert Endre Tarjan
Series editors:	Ron Rozier
Dimensions:	229 x 152 x 8mm (L x W x T)
Format:	Paperback - Trade
Pages:	138
ISBN-13:	978-0-89871-187-5
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation
LSN:	0-89871-187-8
Barcode:	9780898711875

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!