Search for books and compare prices on all major online booksellers with one click!

Home  About UsSuggest BookstoreRecommend Us 
    Title/Keywords ISBN  

Data Structures and Network Algorithms (CBMS-NSF Regional Conference Series in Applied Mathematics)

AUTHOR: R.E. Tarjan
ISBN: 0898711878

Compare Price


HOME--->> Computers & Internet --->>Computer Conferences --->>Computer Conferences
 
Computer Conferences
         Editorial Review

Data Structures and Network Algorithms (CBMS-NSF Regional Conference Series in Applied Mathematics)
- Book Review,
by R.E. Tarjan


Book Description
There has been an explosive growth in the field of combinatorial algorithms. These algorithms depend not only on results in combinatorics and especially in graph theory, but also on the development of new data structures and new techniques for analyzing algorithms. Four classical problems in network optimization are covered in detail, including a development of the data structures they use and an analysis of their running time. Data Structures and Network Algorithms attempts to provide the reader with both a practical understanding of the algorithms, described to facilitate their easy implementation, and an appreciation of the depth and beauty of the field of graph algorithms. Adopted for classroom use by Harvard University, Dartmouth University, the University of Chicago, the University of Colorado, Brown University, the University of Pennsylvania, Johns Hopkins University, and Princeton University (partial listing).


Buy from Amazon     Compare Prices



         Book Review

Data Structures and Network Algorithms (CBMS-NSF Regional Conference Series in Applied Mathematics)
- Book Reviews,
by R.E. Tarjan

Data Structures and Network Algorithms

SYNOPSIS

Detailed and practical applications. There has been an explosive growth in the field of combinatorial algorithms. These algorithms depend not only on results in combinatorics and especially in graph theory, but also on the development of new data structures and new techniques for analyzing algorithms. Four classical problems in network optimization are covered in detail, including a development of the data structures they use and an analysis of their running time. Data Structures and Network Algorithms attempts to provide the reader with both a practical understanding of the algorithms, described to facilitate their easy implementation, and an appreciation of the depth and beauty of the field of graph algorithms. Adopted for classroom use by Harvard University, Dartmouth University, the University of Chicago, the University of Colorado, Brown University, the University of Pennsylvania, Johns Hopkins University, and Princeton University (partial listing).— Vickie Kearn (kearn@siam.org), the Publisher


Buy from Barnes & Noble     Compare Prices




HOME  |  Recommend bookstore  |  Rate bookstore  |  Link to us  |  Report bug  |  Contact us
Copyright© 2003 - 2005, PowerBookSearch.com. All Rights Reserved.