Jon,
I was told my explanations weren't very clear so here it goes with more
details, a much simpler example and explicit links
A dynamic graph algorithm is a classical graph algorithm (say all-pairs
shortest path) that is able to update the result when there is a small
modification of the
Jon,
In ML there has been work on self adjusting computations (check the work of
Amut Acar and unfold recursively).
Dynamic graphs are in a sense an optimization of self-adjusting
computations in the same way logical persistence is an optimization of
physical persistence
Lets say I have an
I just stumbled upon the interesting subject of dynamic graph algorithms,
those that can incrementally alter their output given small changes to the
graph (i.e. adding and removing edges and/or vertices). Topology trees and
sparsification are related subjects. I'm wondering if anyone has done any
