| Title:
|
DATA STRUCTURES AND NETWORK ALGORITHMS
|
| By: |
Robert Endre Tarjan, Ron Rozier |
| Format: |
Paperback |
| List price:
|
£39.99 |
|
We believe that this item is permanently unavailable, and so we cannot source
it.
|
|
|
|
|
|
| ISBN 10: |
0898711878 |
| ISBN 13: |
9780898711875 |
| Publisher: |
SOCIETY FOR INDUSTRIAL & APPLIED MATHEMATICS,U.S. |
| Pub. date: |
1 February, 1984 |
| Series: |
CBMS-NSF Regional Conference Series v. 44 |
| Pages: |
138 |
| Description: |
This book attempts to provide the reader with a practical understanding and appreciation of the field of graph algorithms. |
| 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. |
| Illustrations: |
Ill. |
| Publication: |
US |
| Imprint: |
Society for Industrial & Applied Mathematics,U.S. |
| Returns: |
Returnable |