Normal view MARC view ISBD view

Bounded Incremental Computation [electronic resource] / edited by G. Ramalingam. - Berlin, Heidelberg : Springer Berlin Heidelberg, 1996. - XII, 196 p. online resource. - Lecture Notes in Computer Science, 1089 0302-9743 ; . - Lecture Notes in Computer Science, 1089 .

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.

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.

ISBN: 9783540684589

Standard No.: 10.1007/BFb0028290 doi

Subjects--Topical Terms:
Computer science.
Operating systems (Computers).
Computer software.
Combinatorics.
Computer Science.
Algorithm Analysis and Problem Complexity.
Combinatorics.
Computation by Abstract Devices.
Operating Systems.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1