About this book

Introduction

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.

Keywords

Dynamic Algorithms Dynamische ALgorithemen Graph Algorithms Graph-Theoretic Computations Graphalgorithmen Graphentheoretische Berechnungen Incremental Computation Inkrementelles Rechnen Komplexität Notation algorithms complexity

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0028290
  • Copyright Information Springer-Verlag 1996
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-61320-6
  • Online ISBN 978-3-540-68458-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book