Bounded Incremental Computation
Author:   G. Ramalingam
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Edition:   1996 ed.
Volume:   1089
ISBN:  

9783540613206


Pages:   196
Publication Date:   05 June 1996
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $166.19 Quantity:  
Add to Cart

Share |

Bounded Incremental Computation


Overview

Incremental computation concerns the re-computation of output after a change in the input, whereas algorithms and programs usually derive their output directly from their input. This book investigates the concept of incremental computation and dynamic algorithms in general and provides a variety of new results, especially for computational problems from graph theory: the author presents e.g. efficient incremental algorithms for several shortest-path problems as well as incremental algorithms for the circuit value annotation problem and for various computations in reducible flow graphs.

Full Product Details

Author:   G. Ramalingam
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   1996 ed.
Volume:   1089
Dimensions:   Width: 15.50cm , Height: 1.10cm , Length: 23.50cm
Weight:   0.660kg
ISBN:  

9783540613206


ISBN 10:   354061320
Pages:   196
Publication Date:   05 June 1996
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

On incremental algorithms and their complexity.- Terminology and notation.- Incremental algorithms for shortest-path problems.- Generalizations of the shortest-path problem.- An incremental algorithm for a generalization of the shortest-path problem.- Incremental algorithms for the circuit value annotation problem.- Inherently unbounded incremental computation problems.- Incremental algorithms for reducible flowgraphs.- Conclusions.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions
Latest Reading Guide

ARG20253

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now