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
Highly Influential
This paper has highly influenced 30 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 218 citations. REVIEW CITATIONS
129 Extracted Citations
42 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 129 extracted citations

219 Citations

0102030'95'99'04'09'14
Citations per Year
Semantic Scholar estimates that this publication has 219 citations based on the available data.

See our FAQ for additional information.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 42 references

Data flow analysis and incremental iteration,

  • T. J. Marlowe
  • Ph.D. dissertation and Tech. Rep. DCS-TR-255,
  • 1989
Highly Influential
9 Excerpts

On the dynamic shortest path problem,

  • Lin, C.-C, Chang, R.-C
  • Journal of Information Processing
  • 1990
Highly Influential
10 Excerpts

Similar Papers

Loading similar papers…