Cantitate/Preț
Produs

Data Structures and Network Algorithms: CBMS-NSF Regional Conference Series in Applied Mathematics, cartea 44

Autor Robert Endre Tarjan
en Limba Engleză Paperback – 31 ian 1984
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.
Citește tot Restrânge

Din seria CBMS-NSF Regional Conference Series in Applied Mathematics

Preț: 26479 lei

Preț vechi: 33098 lei
-20% Nou

Puncte Express: 397

Preț estimativ în valută:
5068 5346$ 4223£

Carte indisponibilă temporar

Doresc să fiu notificat când acest titlu va fi disponibil:

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780898711875
ISBN-10: 0898711878
Pagini: 140
Ilustrații: Ill.
Dimensiuni: 179 x 252 x 8 mm
Greutate: 0.25 kg
Editura: Society for Industrial and Applied Mathematics
Colecția Society for Industrial and Applied Mathematics
Seria CBMS-NSF Regional Conference Series in Applied Mathematics

Locul publicării:Philadelphia, United States

Cuprins

Foundations; Disjoint Sets; Heaps; Search Trees; Linking and Cutting Trees; Minimum Spanning Trees; Shortest Paths; Network Flows; Matchings.

Descriere

This book attempts to provide the reader with a practical understanding and appreciation of the field of graph algorithms.