Bounded incremental computation

Bounded incremental computation

by Ramalingam

Part of Lecture notes in computer science ;

1996
Join Readfeed freeFind clubs reading this
Rate this book:

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
"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."--PUBLISHER'S WEBSITE.

Discuss Bounded incremental computation with other readers

Join or start a book club for Bounded incremental computation on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Bounded incremental computation?

Sign up free on Readfeed, then browse public clubs or start your own club with Bounded incremental computation as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Bounded incremental computation with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Bounded incremental computation with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.