David Eppstein <eppstein @ ics . uci . edu> (email mangled to prevent spamming)
Dept. of Information and Computer Science University of California Irvine, CA 92717-3425 USA
Abstract:
In many applications of graph algorithms, including communication networks, graphics, and VLSI design, one encounters graphs subject to discrete changes: edges or vertices may be added or removed. In other situations such as network flow algorithms, the initial graph may be static but solution methods involve transformations to a sequence of related graphs. This bibliography file cites recent papers that have been devoted to algorithms for such dynamically changing graphs, along with some other related work used in these papers and papers on applications of dynamic graph algorithms. It also includes a number of papers on dynamic methods in computational geometry.
