On the Computational Complexity of Dynamic Graph Problems

@article{Ramalingam1996OnTC,
title={On the Computational Complexity of Dynamic Graph Problems},
author={G. Ramalingam and Thomas W. Reps},
journal={Theor. Comput. Sci.},
year={1996},
volume={158},
pages={233-277}
}

A common way to evaluate the time complexity of an algorithm is to use asymptotic worst-case analysis and to express the cost of the computation as a function of the size of the input. However, for an incremental algorithm this kind of analysis is sometimes not very informative. (By an “incremental algorithm,” we mean an algorithm for a dynamic problem.) When the cost of the computation is expressed as a function of the size of the (current) input, several incremental algorithms that have been… CONTINUE READING