Bounded Incremental Computation / edited by G. Ramalingam.Material type: TextSeries: Serienbezeichnung | Lecture notes in computer science ; 1089.Publication details: Berlin, Heidelberg : Springer Berlin Heidelberg, 1996. Description: 1 online resource (xii, 196 pages)Content type: text Media type: computer Carrier type: online resourceISBN: 9783540684589; 3540684581Subject(s): Computer science | Operating systems (Computers) | Computer software | Combinatorial analysis | Combinatorial analysis | Computer science | Computer software | Operating systems (Computers)Genre/Form: Electronic books. Additional physical formats: Print version:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43Online resources: Click here to access online
|Item type||Current library||Collection||Call number||Status||Date due||Barcode||Item holds|
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.
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.