Language: English
Published by Springer Berlin / Heidelberg, 1996
ISBN 10: 354061320X ISBN 13: 9783540613206
Seller: Better World Books, Mishawaka, IN, U.S.A.
Condition: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 69.23
Quantity: Over 20 available
Add to basketCondition: New. In.
US$ 65.55
Quantity: 10 available
Add to basketPF. Condition: New.
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
Taschenbuch. Condition: Neu. Bounded Incremental Computation | G. Ramalingam | Taschenbuch | xii | Englisch | 1996 | Springer | EAN 9783540613206 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Seller: BennettBooksLtd, Los Angeles, CA, U.S.A.
paperback. Condition: New. In shrink wrap. Looks like an interesting title!
Language: English
Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1996, 1996
ISBN 10: 354061320X ISBN 13: 9783540613206
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. 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.
Language: English
Published by Springer Berlin Heidelberg, 1996
ISBN 10: 354061320X ISBN 13: 9783540613206
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 algor.
Language: English
Published by Springer, Springer Jun 1996, 1996
ISBN 10: 354061320X ISBN 13: 9783540613206
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 208 pp. Englisch.