Atlas home || Conferences | Abstracts | about Atlas
Host: University of Victoria
Sponsor: Pacific Institute for the Mathematical Sciences and the Fields Institute for Research in Mathematics
Homepage: http://wren.pims.math.ca/graph2000/dynamic.html
Organizers: Monika Henzinger (Google, Inc.), Professor Valerie King (Department of Computer Science, University of Victoria)
Description:
For any graph problem, we may ask: If a graph instance undergoes an on-line sequence of updates, can one
make use of previous computation to recompute the solution after each update more quicklyNULL The study of
dynamic graph problems has recently undergone some dramatic developments. The goal of this workshop is
to bring together experts on various topics in the area with interested students and researchers, to discuss
the current state of the field, identify promising directions for research, and do some problem-solving.
Topics include: proving lower bounds, problems in computational geometry, new and old problems for
undirected and for directed graphs, problems on trees, and applications to networks, data bases and
programming languages.
Date received: November 24, 1999
© 2008 Atlas Conferences Inc.