Introduction to algorithams: a creative approach / (Record no. 3455)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 06367nam a2200145 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780201120370 (pb) |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | CUS |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.73 |
| Item number | MAN/I |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Mnber, Udi |
| 245 ## - TITLE STATEMENT | |
| Title | Introduction to algorithams: a creative approach / |
| Statement of responsibility, etc. | Udi manber |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | New York : |
| Name of publisher, distributor, etc. | Addison Wesley , |
| Date of publication, distribution, etc. | c1989. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xiv, 478 p. |
| Other physical details | ill. ; |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Chapter 1 Introduction<br/>Chapter 2 Mathematical induction<br/>2.1 Introduction<br/>2.2 Tliree Simple Examples<br/>2.3 Counting Regions in the Plane<br/>2.4 A Simple Coloring Problem<br/>2.5 A More Complicated Summation Problem<br/>2.6 A Simple Inequality<br/>2.7 Euler's Fonnula<br/>2.8 A Problem in Graph Theory<br/>2.9 Gray Codes<br/>2.10 Finding Edge-Disjoint Paths in a Graph<br/>2.11 Arithmetic versus Geometric Mean Theoiem<br/>2.12 Loop Invariants: Converting a Decimal Number to Binary<br/>2.13 Common Errors<br/>2.14 Summary<br/>Bibliogiaphic Notes and Further Reading<br/>Exercises<br/>Chapter 3 Analysis of Algoi ithms<br/>3.1 Introduction<br/>3.2 The 0 Notation<br/>3.3 Time and Space Complexity<br/>3.4 Summations<br/>3.5 Recurrence Relations<br/>3.5.1 Intelligent Guesses<br/>3.5.2 Divide and Cotiquer Relations<br/>3.5.3 Recuirence Relations with Full History<br/>3.6 Useful Facts<br/>3.7 Summary .<br/>Bibliographic Notes and Further Reading<br/>Exercises<br/>Chapter 4 Data Structures<br/>4.1 Introduction<br/>4.2 Elementary Data Structures<br/>4.2.1 Elements<br/>4.2.2 Arrays<br/>4.2.3 Records<br/>4.2.4 Linked Lists<br/>4.3 Trees<br/>4.3.1 Representation of Trees<br/>4.3.2 Heaps<br/>4.3.3 Binary Search Trees<br/>4.3.4 AVL Trees<br/>4.4 Hashing<br/>4.5 The Union-Find Problem<br/>4.6 Graphs<br/>4.7 Summary<br/>Bibliographic Notes and Further Reading<br/>Exercises<br/>Chapter S Design of Algorithms by Induction<br/>5.1 Introduction<br/>5.2 Evaluating Polynomials<br/>5.3 Maximal Induced Subgraph<br/>5.4 Finding One-to-One Mappings<br/>5.5 The Celebrity Problem<br/>5.6 A Divide-and-Conquer Algorithm: The Skyline Problem<br/>5.7 Computing Balance Factors in Binary Trees<br/>5.8 Finding the Maximum Consecutive Subsequence<br/>5.9 Strengthening the Induction Hypothesis<br/>5.10 Dynamic Programming: The Knapsack Problem<br/>5.11 Common Errors<br/>5.12 Summary<br/>*<br/>Bibliographic Notes and Further Reading<br/>Exercises<br/>Chapter 6 Algorithms Involving Sequences and Sets<br/>6.1 Introduction<br/>6.2 Binary Search and Variations<br/>6.3 Interpolation Search<br/>6.4 Sorting<br/>6.4.1 Bucket Sort and Radix Sort<br/>6.4.2 Insertion Sort and Selection Sort<br/>6.4.3 Mergesort<br/>6.4.4 Quicksort<br/>6.4.5 Heapsoit<br/>6.4.6 A Lower Bound for Sorting<br/>6.5 Order Statistics<br/>6.5.1 Maximum and Minimum Elements<br/>6.5.2 Finding the ftth-Smallest Element<br/>6.6 Data Compression<br/>6.7 String Matching<br/>6.8 Sequence Comparisons<br/>6.9 Probabilistic Algorithms<br/>6.9.1 Random Numbers<br/>6.9.2 A Coloring Problem<br/>6.9.3 A Technique for Tiansfonning Probabilistic<br/>Algorithms into Deterministic Algorithms<br/>6.10 Finding a Majority<br/>6.11 Three Problems Exhibiting Interesting Proof Techniques<br/>6.11.1 Longest Increasing Subsequence<br/>6.11.2 Finding the Two Largest Elements in a Set<br/>6.11.3 Computing the Mode of a Multiset<br/>6.12 Summary<br/>Bibliographic Notes and Further Reading<br/>Exercises<br/>Chapter 7 Graph Algorithms<br/>7.1 Introduction<br/>7.2 Eulerian Graphs<br/>7.3 Graph Traversals<br/>7.3.1 Depth-First Search<br/>7.3.2 Breadth-First Search<br/>7.4 Topological Sorting<br/>7.5 Single-Source Shortest Paths<br/>7.6 Minimum-Cost Spanning Trees<br/>7.7 All Shortest Paths<br/>7.8 Transitive Closure<br/>7.9 Decompositions of Graphs<br/>7.9.1 Biconnected Components<br/>7.9.2 Strongly Connected Components<br/>7.9.3 Examples of the Use of Graph Decomposition<br/>7.10 Matching<br/>7.10.1 Perfect Matching in Very Dense Graphs<br/>7.10.2 Bipartite Matching<br/>7.11 Network Flows<br/>7.12 Hamiltonian Tours<br/>7.12.1 Reversed Induction<br/>7.12.2 Finding Hamiltonian Cycles in Very Dense Graphs<br/>7.13 Summary<br/>Bibliographic Notes and Further Reading<br/>Exercises<br/>Chapter 8 Geomelric Algorithms<br/>8.1 Introduction<br/>8.2 Delemiining Whether a Point Is Inside a Polygon<br/>8.3 Constructing Simple Polygons<br/>8.4 Convex Hulls<br/>8.4.1 A Straightforward Approach<br/>8.4.2 Gift Wrapping<br/>8.4.3 Graham's Scan<br/>8.5 Closest Pair<br/>8.6 Intersections of Horizontal and Vertical Line Segments<br/>8.7 Summary<br/>Bibliographic Notes and Furtiier Reading<br/>Exercises<br/>Chapter 9 Algebraic and Numeric Algorithms<br/>9.1 Introduction<br/>9.2 Exponentiation<br/>9.3 Euclid's Algorithm<br/>9.4 Polynomial Multiplication<br/>9.5 Matrix Multiplication<br/>9.5.1 Winograd's Algorithm<br/>9.5.2 Strasseti's Algorithm<br/>9.5.3 Boolean Matrices<br/>9.6 The Fast Fourier Transfomi<br/>9.7 Summary<br/>Bibliographic Notes and Further Reading<br/>Exercises<br/>i3hapter10 Redtictlons<br/>10.1 Introduction<br/>1(^2 Examples of Reductions<br/>10.2.1 A Simple String-Matching Problem<br/>10.2.2 Systems of Distinct Representatives<br/>10.2.3 A Reduction Involving Sequence Cotnparisons<br/>10.2.4 Finding a Tiiangle in 1 Indirected Graphs<br/>10.3 Reductions Involving Linear Progr.immiug<br/>10.3.1 Introduction atid nefiniiions<br/>10.3.2 Examples of Reductions to Linear Programming<br/>10.4 Rcduclion.s for Lower Bounds<br/>10.4.1 A Lower Bound for Finding Simple Polygons<br/>10.4.2 Simple Reductions Involving Matrices<br/>10.5 Common En ors<br/>10.6 Summary<br/>Bibliographic Notes and Further Reading<br/>Exercises<br/>Chapter I f NP-Coiopletetiess<br/>1 1.1 Introduction<br/>11.2 Polynomial-Time Reductions<br/>11.3 Nondclemiinism and Cook's I heotem<br/>11.4 Examples of NP-Cuinplelenc.ss Pioofs<br/>11.4.1 Veitex Cover<br/>11.4.2 Dominating Set<br/>11.4.3 3SAr<br/>11.4.4 Clkjue<br/>11.4.5 3-Coioiing<br/>1 1.4.6 General Observations<br/>1! .4.7 Mote NP-Complete Problems<br/>11.5 rechniques Foi [dealing with NP-Complete Problems<br/>11.5.1 Backtracking and Biancii-and-Boimd<br/>11.5.2 Appioxirnation Algoritlims with Guaianteed<br/>11.6 Summary<br/>Perfoimance<br/>Bibliographic Notes and Further Reading<br/>Exercises<br/>Chapter 12 Parallel Alyorilhins<br/>12.1 Intioduction<br/>12.2 Models ofl'aiallel Computation<br/>12.3 Algorithms lor Shatcd-Memory Machines<br/>12.3.1 Parallel Addition<br/>12.3.2 Maxinuim-Finding Algorithms<br/>12.3.3 The Parallcl-Pielix Problem<br/>12.3.4 Finding Ratiks in Linked Lists<br/>12.3.5 The Euler's Tour Technique *<br/>12.4 Algol itiims for Interconnection Networks<br/>12.4.1 Sorting r)n an Array<br/>12.4.2 Sorting Networks<br/>12.4.3 Finding the Aith-Smallest Element on a Tree<br/>12.4.4 Maliix Multiplication on the Mesh<br/>12.4.5 Routing in a Hypercube<br/>12.5 Systolic Computation<br/>12.5.1 Matrix-Vector Multiplication<br/>12.5.2 The Convolution Problem<br/>12.5.3 Sequence Comparisons<br/>12.6 Summary<br/>Bibliographic Notes and Further Reading<br/>Exercises |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | GN Books |
| Withdrawn status | Lost status | Damaged status | Not for loan | Home library | Current library | Shelving location | Date acquired | Full call number | Accession number | Date last seen | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Central Library, Sikkim University | Central Library, Sikkim University | General Book Section | 23/06/2016 | 005.73 MAN/I | P20831 | 23/06/2016 | General Books |