Bounded Incremental Computation

Paperback Engels 1996 1996e druk 9783540613206
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

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.

Specificaties

ISBN13:9783540613206
Taal:Engels
Bindwijze:paperback
Aantal pagina's:196
Uitgever:Springer Berlin Heidelberg
Druk:1996

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Inhoudsopgave

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.

Managementboek Top 100

Rubrieken

    Personen

      Trefwoorden

        Bounded Incremental Computation