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

Mehlhorn, Kurt:

ISBN 10: 354013302X / ISBN 13: 9783540133025

Published by Springer Verlag, 1984

About this Item

XII, 260, XII, 336, XII, 284 Seiten (pages) Original Pappband, Hardcover. Mit zwei Stempeln, tadellos erhalten. With two stamps inside, in top condition. (354013641X,3540136428) MIG-31-03A|G58 Sprache: Englisch Gewicht in Gramm: 1265.

Seller Inventory # 45745

Bibliographic Details

• Title: Graph Algorithms and NP-Completeness 2. Band; Sorting and Searching, 3. band Multi-dimensional Searching and Computational Geometry Data Structures and Algorithms 1, 2 and 3
• Publisher: Springer Verlag
• Publication Date: 1984
• Language: English
• ISBN 10: 354013302X
• ISBN 13: 9783540133025
• Binding: 25 x 17 cm
• Edition: 3 Bände (3 volumes).
• Condition: Gut
• Seller catalogs:
  • Modernes Antiquariat

About this title

Synopsis

The design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of "algorithm" is central in computer science, and "efficiency" is central in the world of money. I have organized the material in three volumes and nine chapters. Vol. 1: Sorting and Searching (chapters I to III) Vol. 2: Graph Algorithms and NP-completeness (chapters IV to VI) Vol. 3: Multi-dimensional Searching and Computational G- metry (chapters VII and VIII) Volumes 2 and 3 have volume 1 as a common basis but are indepen­ dent from each other. Most of volumes 2 and 3 can be understood without knowing volume 1 in detail. A general kowledge of algorith­ mic principles as laid out in chapter 1 or in many other books on algorithms and data structures suffices for most parts of volumes 2 and 3. The specific prerequisites for volumes 2 and 3 are listed in the prefaces to these volumes. In all three volumes we present and analyse many important efficient algorithms for the fundamental computa­ tional problems in the area. Efficiency is measured by the running time on a realistic model of a computing machine which we present in chapter I. Most of the algorithms presented are very recent inven­ tions; after all computer science is a very young field. There are hardly any theorems in this book which are older than 20 years and at least fifty percent of the material is younger than 10 years.