Bounded Incremental Computation [electronic resource] / edited by G. Ramalingam.
Material type: TextSeries: Lecture Notes in Computer Science ; 1089Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1996Description: XII, 196 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540684589Subject(s): Computer science | Operating systems (Computers) | Computer software | Combinatorics | Computer Science | Algorithm Analysis and Problem Complexity | Combinatorics | Computation by Abstract Devices | Operating SystemsAdditional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43Online resources: Click here to access onlineCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK7002 |
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.
There are no comments on this title.