Bounded Incremental Computation

G. Ramalingam

ISBN 10: 354061320X / ISBN 13: 9783540613206

Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1996, 1996

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 208 pp. Englisch.

Seller Inventory # 9783540613206

Bibliographic Details

• Title: Bounded Incremental Computation
• Publisher: Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1996
• Publication Date: 1996
• Language: English
• ISBN 10: 354061320X
• ISBN 13: 9783540613206
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 12D millimeters 235 millimeters width by 155 millimeters height by 12 millimeters depth
• Weight: 324 grams

About this title

Synopsis

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.