My Account | Home| Bulletin Board| Cart | Help
Close Session
IISER-KIndian Institute of Science Education & Research - Kolkata
Quick Search
Search Terms:
All Documents
Books
Newspapers
Periodicals
Articles
Theses
E-Books
Database : IISERK

Set Session Filters
Login to ask the library to add a book.
Active Filter Settings
No Active Filters
There are 0 titles in your cart.

Search History
Serial Collections: Newspapers
ty:m & bl:m
Special Collections: Music Scores
Special Collections: Maps
Special Collections: Audio Cassettes
Special Collections: Government Publications
Recommended Reading
first record | previous record | next record | last record
full | marc
Record 2 of 12
  Total Requests  0      Unsatisfied Requests  0
You searched IISERK - Subject: Air Pollution PreĢvision.
Request
Call Number 001.64/2
Author Tarjan, Robert E. (Robert Endre), 1948-
Title Data structures and network algorithms [electronic resource] / Robert Endre Tarjan.
Publication Philadelphia, Pa. : Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), 1983.
Material Info. 1 electronic text (vii, 131 p.) : ill., digital file.
Series CBMS-NSF regional conference series in applied mathematics ; 44
Series CBMS-NSF regional conference series in applied mathematics ; 44.
Summary Note 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.
Notes Includes bibliographical references (p. 125-131).
Notes Foundations -- Disjoint sets -- Heaps -- Search trees -- Linking and cutting trees -- Minimum spanning trees -- Shortest paths -- Network flows -- Matchings.
ISBN 9781611970265 (electronic bk.)
Subject Data structures (Computer science)
Subject Computer algorithms.
Subject Trees (Graph theory)
Subject Data structures
Subject Network algorithms
Subject Trees
Subject Disjoint sets
Subject Heaps
Subject Shortest paths
Subject Matchings
Added Entry Society for Industrial and Applied Mathematics.
Date Year, Month, Day:01405141
Link SIAM

Keyword Search

 Words: Search Type:
 
 

Database: IISERK

Any filter options that are chosen below will be combined with the Session Filters and applied to the search.
Nature of Contents Filters Format Filters

Including Excluding

Including Excluding
Language Filters Place of Publication Filters

Including Excluding

Including Excluding
Publication Date Context Date
  -     -  

Set Session Filters
Select below to return to the last:
Copyright © 2014 VTLS Inc. All rights reserved.
VTLS.com