On the computational complexity of dynamic graph problems

This publication has 28 references indexed in Scilit:

• A dynamization of the All Pairs Least Cost Path Problem
  Published by Springer Nature ,2005
• Incremental algorithms for minimal length paths
  Journal of Algorithms, 1991
• Profiling an incremental data flow analysis algorithm
  IEEE Transactions on Software Engineering, 1990
• The Synthesizer Generator: A system for constructing language-based editors: Thomas W. Reps and Tim Teitelbaum (Springer)
  Computer Languages, 1989
• Time polynomial in input or output
  The Journal of Symbolic Logic, 1989
• Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
  Communications of the ACM, 1988
• Incremental data-flow analysis algorithms
  ACM Transactions on Programming Languages and Systems, 1988
• Incremental data flow analysis in a structured program editor
  ACM SIGPLAN Notices, 1984
• On incremental evaluation of ordered attributed grammars
  BIT Numerical Mathematics, 1983
• Incremental Context-Dependent Analysis for Language-Based Editors
  ACM Transactions on Programming Languages and Systems, 1983