Bounded Incremental Computation

1. Front Matter

   PDF

2. Introduction

   Pages 1-6

3. On incremental algorithms and their complexity

   Pages 7-24

4. Terminology and notation

   Pages 25-29

5. Incremental algorithms for shortest-path problems

   Pages 30-51

6. Generalizations of the shortest-path problem

   Pages 52-77

7. An incremental algorithm for a generalization of the shortest-path problem

   Pages 78-100

8. Incremental algorithms for the circuit value annotation problem

   Pages 101-129

9. Inherently unbounded incremental computation problems

   Pages 130-146

10. Incremental algorithms for reducible flowgraphs

    Pages 147-168

11. Conclusions

    Pages 169-171

12. Back Matter

    PDF

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.

• Dynamic Algorithms
• Dynamische ALgorithemen
• Graph Algorithms
• Graph-Theoretic Computations
• Graphalgorithmen
• Graphentheoretische Berechnungen
• Incremental Computation
• Inkrementelles Rechnen
• Komplexität
• Notation
• algorithms
• complexity
• algorithm analysis and problem complexity
• combinatorics

Policies and ethics