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.

Bibliographic Information

Book Title: Bounded Incremental Computation
Editors: G. Ramalingam
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/BFb0028290
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1996
Softcover ISBN: 978-3-540-61320-6Published: 05 June 1996
eBook ISBN: 978-3-540-68458-9Published: 23 November 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XII, 196
Topics: Algorithm Analysis and Problem Complexity, Combinatorics, Computation by Abstract Devices, Operating Systems

Publish with us

Policies and ethics

Bounded Incremental Computation

Overview

Access this book

Other ways to access

Table of contents (10 chapters)

Front Matter

Back Matter

Keywords

About this book

Bibliographic Information

Publish with us

Search

Navigation