| 书目名称 | Data Structures and Algorithms 1 |
| 副标题 | Sorting and Searchin |
| 编辑 | Kurt Mehlhorn |
| 视频video | http://file.papertrans.cn/264/263161/263161.mp4 |
| 丛书名称 | Monographs in Theoretical Computer Science. An EATCS Series |
| 图书封面 |  |
| 描述 | 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 algo |
| 出版日期 | Textbook 1984 |
| 关键词 | NP-completeness; Structures; algorithms; computer; computer science; data structures; sorting; algorithm an |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-69672-5 |
| isbn_softcover | 978-3-642-69674-9 |
| isbn_ebook | 978-3-642-69672-5Series ISSN 1431-2654 Series E-ISSN 2193-2069 |
| issn_series | 1431-2654 |
| copyright | Springer-Verlag Berlin Heidelberg 1984 |
|Archiver|手机版|小黑屋|
派博传思国际
( 京公网安备110108008328)
GMT+8, 2025-8-19 16:49
发表于 2025-3-21 18:14:30
