Bounded Incremental Computation

G. Ramalingam (Autor)

Buch | Softcover

XII, 196 Seiten

1996 | 1996
Springer Berlin (Verlag)
978-3-540-61320-6 (ISBN)

Infos

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.

Inhalt

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.

Produkt-Details

• Erscheint lt. Verlag: 5.6.1996
• Reihe/Serie: Lecture Notes in Computer Science
• Zusatzinfo: XII, 196 p.
• Verlagsort: Berlin
• Sprache: englisch
• Maße: 155 x 235 mm
• Gewicht: 284 g
• Themenwelt: Informatik ► Theorie / Studium ► Algorithmen
• Themenwelt: Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
• Schlagworte: Algorithm analysis and problem complexity • algorithms • combinatorics • Complexity • Dynamic Algorithms • Dynamische ALgorithemen • Graphalgorithmen • Graph Algorithms • Graphenalgorithmen • Graphentheoretische Berechnungen • Graph-Theoretic Computations • Incremental Computation • Inkrementelles Rechnen • Komplexität • Notation
• ISBN-10: 3-540-61320-X / 354061320X
• ISBN-13: 978-3-540-61320-6 / 9783540613206
• Zustand: Neuware