Item description for Bounded Incremental Computation (Lecture Notes in Computer Science) by G. Ramalingam...
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.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 9.21" Width: 6.22" Height: 0.47" Weight: 0.71 lbs.
Release Date Jun 5, 1996
ISBN 354061320X ISBN13 9783540613206
Availability 73 units. Availability accurate as of Jan 24, 2017 02:17.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.