Introduction to algorithms (Book, 2009) [紀伊國屋]
skip to content
Introduction to algorithms Preview this item
ClosePreview this item

Introduction to algorithms

Author: Thomas H Cormen; Charles Eric Leiserson; Ronald L Rivest; Clifford Stein
Publisher: Cambridge, Mass. : MIT Press, [2009] ©2009
Edition/Format:   Print book : Document   Computer File : English : Third editionView all editions and formats
Summary:
This edition has been revised and updated throughout. It includes some new chapters. It features improved treatment of dynamic programming and greedy algorithms as well as a new notion of edge-based flow in the material on flow networks.--[book cover].
You are not connected to the 紀伊國屋 network. Access to online content and services may require you to authenticate with your library. 学外から利用する(EZproxy_kait)
Getting this item's online copy... Getting this item's online copy...

Find a copy in the library

Getting this item's location and availability... Getting this item's location and availability...

WorldCat

Find it in libraries globally
Worldwide libraries own this item

Details

Genre/Form: Textbooks
Informational works
Material Type: Document, Internet resource
Document Type: Book, Computer File, Internet Resource
All Authors / Contributors: Thomas H Cormen; Charles Eric Leiserson; Ronald L Rivest; Clifford Stein
ISBN: 9780262033848 0262033844 9780262533058 0262533057 0262270838 9780262270830
OCLC Number: 311310321
Description: xix, 1292 pages : illustrations ; 24 cm
Contents: I. Foundations. The role of algorithms in computing --
Getting started --
Growth of functions --
Divide-and-conquer --
Probabilistic analysis and randomized algorithms --
II. Sorting and order statistics. Heapsort --
Quicksort --
Sorting in linear time --
Medians and order statistics --
III. Data structures. Elementary data structures --
Hash tables --
Binary search trees --
Red-black trees --
Augmenting data structures --
IV. Advanced design and analysis techniques. Dynamic programming --
Greedy algorithms --
Amortized analysis --
V. Advanced data structures. B-trees --
Fibonacci heaps --
van Emde Boas trees --
Data structures for disjoint sets --
VI. Graph algorithms. Elementary graph algorithms --
Minimum spanning trees --
Single-source shortest paths --
All-pairs shortest paths --
Maximun flow --
VII. Selected topics. Multithreaded algorithms --
Matrix operations --
Linear programming --
Polynomials and the FFT --
Number-theoretic algorithms --
String matching --
Computational geometry --
NP-completeness --
Approximation algorithms --
VIII. Appendix: Mathematical background. Summations --
Sets, etc. --
Counting and probability --
Matrices.
Responsibility: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.

Abstract:

This edition has been revised and updated throughout. It includes some new chapters. It features improved treatment of dynamic programming and greedy algorithms as well as a new notion of edge-based flow in the material on flow networks.--[book cover].
Retrieving notes about this item Retrieving notes about this item

Reviews

User-contributed reviews

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.