Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Bounded Incremental Computation

Bounded Incremental Computation

Ramalingam, G.

Paperback

Series: Lecture Notes in Computer Science, Book 1089

General ComputersOperating Systems

ISBN10: 354061320X
ISBN13: 9783540613206
Publisher: Springer
Published: Jun 5 1996
Pages: 196
Weight: 0.66
Height: 0.44 Width: 6.14 Depth: 9.21
Language: English
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.

Also from

Ramalingam, G.

View All

Also in

General Computers

View All