Book Volume 1089 1996

Bounded Incremental Computation

Editors:

ISBN: 978-3-540-61320-6 (Print) 978-3-540-68458-9 (Online)

Table of contents (10 chapters)

  1. Front Matter

    Pages -

  2. No Access

    Chapter and Conference Paper

    Pages 1-6

    Introduction

  3. No Access

    Chapter and Conference Paper

    Pages 7-24

    On incremental algorithms and their complexity

  4. No Access

    Chapter and Conference Paper

    Pages 25-29

    Terminology and notation

  5. No Access

    Chapter and Conference Paper

    Pages 30-51

    Incremental algorithms for shortest-path problems

  6. No Access

    Chapter and Conference Paper

    Pages 52-77

    Generalizations of the shortest-path problem

  7. No Access

    Chapter and Conference Paper

    Pages 78-100

    An incremental algorithm for a generalization of the shortest-path problem

  8. No Access

    Chapter and Conference Paper

    Pages 101-129

    Incremental algorithms for the circuit value annotation problem

  9. No Access

    Chapter and Conference Paper

    Pages 130-146

    Inherently unbounded incremental computation problems

  10. No Access

    Chapter and Conference Paper

    Pages 147-168

    Incremental algorithms for reducible flowgraphs

  11. No Access

    Chapter and Conference Paper

    Pages 169-171

    Conclusions

  12. Back Matter

    Pages -