0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Mathematical theory of computation

Buy Now

Bounded Incremental Computation (Paperback, 1996 ed.) Loot Price: R1,533
Discovery Miles 15 330
Bounded Incremental Computation (Paperback, 1996 ed.): G. Ramalingam
Bounded Incremental Computation (Paperback, 1996 ed.): G. Ramalingam

Share your images

Bounded Incremental Computation (Paperback, 1996 ed.)

G. Ramalingam

Series: Lecture Notes in Computer Science, 1089

 (sign in to rate)
Loot Price R1,533 Discovery Miles 15 330 | Repayment Terms: R142 pm x 12*

Bookmark and Share

Expected dispatch within 7 - 15 working days

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.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Lecture Notes in Computer Science, 1089
Release date: June 1996
First published: 1996
Authors: G. Ramalingam
Dimensions: 235 x 155 x 11mm (L x W x T)
Format: Paperback
Pages: 196
Edition: 1996 ed.
ISBN-13: 978-3-540-61320-6
Barcode: 9783540613206
Categories: Books > Computing & IT > General theory of computing > Mathematical theory of computation
Promotions
LSN: 3-540-61320-X

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Loyalty partners