Data Structures and Network Algorithms

Robert Endre Tarjan

ISBN 10: 0898711878 / ISBN 13: 9780898711875

Published by Society for Industrial and Applied Mathematics,U.S., US, 1984

About this Item

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.

Seller Inventory # LU-9780898711875

Bibliographic Details

• Title: Data Structures and Network Algorithms
• Publisher: Society for Industrial and Applied Mathematics,U.S., US
• Publication Date: 1984
• Language: English
• ISBN 10: 0898711878
• ISBN 13: 9780898711875
• Binding: Paperback
• Condition: New
• Weight: 240 grams

About this title

Synopsis

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.

Book Description

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 closely examined.