Bounded Incremental Computation (Lecture Notes In Computer Science): 1089 - Tapa blanda

Ramalingam, G.

 
9783540613206: Bounded Incremental Computation (Lecture Notes In Computer Science): 1089

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.