Can I read Data Structures and Algorithms 2 : Graph Algorithms and NP-Completeness on EtoBox?

Data Structures and Algorithms 2 : Graph Algorithms and NP-Completeness by Kurt Mehlhorn, Mehlhorn, K., K. Mehlhorn is a computer science book available to read on EtoBox.

What is Data Structures and Algorithms 2 : Graph Algorithms and NP-Completeness about?

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 algorith

Who reads Data Structures and Algorithms 2 : Graph Algorithms and NP-Completeness?

Author

Kurt Mehlhorn, Mehlhorn, K., K. Mehlhorn

Publisher

Springer Spektrum. in Springer-Verlag GmbH

Published

1984

Language

EN

ISBN

9780387136417

Category

computer science

Subjects

Management, Mathematics, Science

Updated

2026-03-25