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 ...
Read More
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.
Read Less
Add this copy of Bounded Incremental Computation to cart. $51.65, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 1996 by Springer.
Add this copy of Bounded Incremental Computation to cart. $74.54, new condition, Sold by Ria Christie Books rated 4.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 1996 by Springer.
Add this copy of Bounded Incremental Computation (Lecture Notes in to cart. $102.90, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 1996 by Springer.
Add this copy of Bounded Incremental Computation (Lecture Notes in to cart. $138.27, new condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 1996 by Springer.
