Data Structures and Network Algorithms (CBMS-NSF Regional Conference Series in Applied Mathematics)

Robert Endre Tarjan

ISBN 10: 0898711878 / ISBN 13: 9780898711875

Published by Society for Industrial and Applied Mathematics, 1987

About this Item

1987. Paperback. This book attempts to provide the reader with a practical understanding and appreciation of the field of graph algorithms. Series Editor(s): Rozier, Ron. Series: CBMS-NSF Regional Conference Series in Applied Mathematics. Num Pages: 140 pages, Ill. BIC Classification: UYA. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 254 x 175 x 8. Weight in Grams: 262. Series: CBMS-NSF Regional Conference Series in Applied Mathematics. 140 pages, Ill. This book attempts to provide the reader with a practical understanding and appreciation of the field of graph algorithms. Cateogry: (P) Professional & Vocational; (U) Tertiary Education (US: College). BIC Classification: UYA. Dimension: 254 x 175 x 8. Weight: 234. Series Editor(s) :Rozier, Ron. . . . . .

Seller Inventory # V9780898711875

Bibliographic Details

• Title: Data Structures and Network Algorithms (CBMS-NSF Regional Conference Series in Applied Mathematics)
• Publisher: Society for Industrial and Applied Mathematics
• Publication Date: 1987
• Language: English
• ISBN 10: 0898711878
• ISBN 13: 9780898711875
• Binding: Soft cover
• Condition: New

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.