Shopping Cart Shopping Cart 0 items
info@oldcomputerbooks.com
Item Details
3 volumes, Data Structures and Algorithms, vol 1, Sorting and Searching; vol 2 Graph Algorithms and NP-Completeness; vol 3, Multi-dimensional Searching and Computational Geometry. Kurt Mehlhorn, EATCS Monographs on Theoretical Computer Science, Rozenberg and Solomaa Brauer.

3 volumes, Data Structures and Algorithms, vol 1, Sorting and Searching; vol 2 Graph Algorithms and NP-Completeness; vol 3, Multi-dimensional Searching and Computational Geometry.

Springer-Verlag, Germany & NY, 1984; 336, 260, and 284 pages, indexes, diagrams, bibliographic notes etc.
Condition: Very Good overall, all three volumes hardcover, silver with red and black titles and decoration. Bindings are all sound and secure, pages are clean and unmarked.
Price: $25.00
Item no. M626
Item Description
This three-volume work is devoted to data structures and efficient algorithms. It covers Sorting and Searching; Graph Algorithms and NP-Completeness; and Multi-dimensional Searching and Computational Geometry, indepth. It presents the best algorithms known for a wide range of problems, together with the techniques which are necessary for their analysis. It introduces the reader to the underlying concepts and principles, thus allowing readers to develope efficient algorithms and data structures, to analyse their efficiency, and to prove them correct. Can be used as a textbook for self-study, also as a reference book for practictioners interested in the subject.

Includes sections on machine models, basic data types, generatl sorting methods, heapsort, quicksort, bucketsort etc; hashing, binary search and interpolation search, dynamic weighted trees, algorithmic paradigms and more. Volume 2, graphs topological sorting, transitive closure, depth first and breadth first search, network flow, planar testing, matrix multiplication, NP-completeness, approximation algorithms, more; Volume 3, Multi-dimensional data structures, polygon trees, range trees, convex polygons, plane and space sweep, geometric transforms, more.