Data structures and network algorithms /

Saved in:
Bibliographic Details
Author / Creator:Tarjan, Robert E. (Robert Endre), 1948-
Imprint:Philadelphia, Pa. : Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), 1983.
Description:1 online resource (vii, 131 pages) : illustrations, digital file
Language:English
Series:CBMS-NSF regional conference series in applied mathematics ; 44
CBMS-NSF regional conference series in applied mathematics ; 44.
Subject:Data structures (Computer science)
Computer algorithms.
Trees (Graph theory)
Computer algorithms.
Data structures (Computer science)
Trees (Graph theory)
Electronic books.
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/12577351
Hidden Bibliographic Details
Other authors / contributors:Society for Industrial and Applied Mathematics.
ISBN:9781611970265
1611970261
0898711878
9780898711875
Notes:Title from title screen, viewed 04/05/2011.
Includes bibliographical references (pages 125-131).
Summary: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.
Other form:Print version: 0898711878 9780898711875