Meer over G. Ramalingam

G. Ramalingam

Bounded Incremental Computation

Name: Bounded Incremental Computation
Author: G. Ramalingam

Specificaties

Paperback, 196 blz. | Engels

Springer Berlin Heidelberg | 1996e druk, 1996

ISBN13: 9783540613206

Rubricering

Juridisch :

Springer Berlin Heidelberg 1996e druk, 1996 9783540613206

Onderdeel van serie Lecture Notes in Computer Science

€ 60,99

In winkelwagen

Levertijd ongeveer 9 werkdagen

Gratis verzonden

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

Hoofdrubriek:Programmeren, Computer en informatica

Serie:Lecture Notes in Computer Science

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.

Uw winkelwagen

Bounded Incremental Computation

Samenvatting

Specificaties

Inhoudsopgave

Net verschenen

Rubrieken

Personen

Trefwoorden